By Topic

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date 6-9 July 2009

Filter Results

Displaying Results 1 - 25 of 348
  • [Front cover]

    Publication Year: 2009, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (555 KB)
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • CIE39 presentation

    Publication Year: 2009, Page(s): I
    Request permission for commercial reuse | PDF file iconPDF (74 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2009, Page(s): II
    Request permission for commercial reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • CIE39 chairs

    Publication Year: 2009, Page(s): III
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Plenary sessions

    Publication Year: 2009, Page(s): IV
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):V - XXI
    Request permission for commercial reuse | PDF file iconPDF (157 KB)
    Freely Available from IEEE
  • Index

    Publication Year: 2009, Page(s):1 - 10
    Request permission for commercial reuse | PDF file iconPDF (146 KB)
    Freely Available from IEEE
  • [CD disc label]

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (501 KB)
    Freely Available from IEEE
  • [CD jacket back]

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (1609 KB)
    Freely Available from IEEE
  • A tight MIP formulation for the Discrete Lot-sizing and Scheduling problem with parallel resources

    Publication Year: 2009, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1319 KB) | HTML iconHTML

    We study a production planning problem known as the Discrete Lot-sizing and Scheduling problem with sequence-dependent changeover costs. We consider here the case where there are several identical parallel resources available for production and we propose solving the resulting optimization problem as a mixed-integer program (MIP) using a commercial solver. This is achieved thanks to the extension ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling splittable tasks on multi-purpose parallel machines with release dates and deadlines

    Publication Year: 2009, Page(s):7 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1207 KB) | HTML iconHTML

    In industrial production, a changeover or a setup is a very complex operation to consider and the probability that something breaks on the production line immediately after a changeover is raised significantly. A number of studies about scheduling problems that take into consideration setup times have been presented recently. The problem presented in this paper consist in minimizing the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A particle swarm approach for the MLLP

    Publication Year: 2009, Page(s):12 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB) | HTML iconHTML

    This contribution presents a discrete particle swarm optimization (DPSO) approach for the multi-level lot-sizing problem (MLLP), which is an uncapacitated lot sizing problem dedicated to materials requirements planning (MRP) systems. The originality of the proposed DPSO approach is that it is based on cost modification. By the way, we use PSO for that it has been developed: the continuous optimiza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing makespan subject to budget limitation in hybrid flow shop

    Publication Year: 2009, Page(s):18 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1039 KB) | HTML iconHTML

    Flow shop production lines have been practiced for many years in manufacturing systems. Makespan is the total completion time of all the activities and is known as one of the most criteria in manufacturing systems. Minimizing this criteria causes more efficiently use of the resources specially machinery and manpower. By assigning some budget to some of the operations the operation time of these ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for earliness-tardiness minimization on a single machine

    Publication Year: 2009, Page(s):23 - 27
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2057 KB) | HTML iconHTML

    In this paper, we propose tow lower bounds for the problem of scheduling N-independent jobs on a single machine to minimize the sum of early and tardy costs. Jobs have distinct due dates and processing times with earliness and tardiness costs. The problem is proved to be NP-hard. A simple local search algorithm is presented in order to derive an upper bound for the problem and tested the proposed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine scheduling with sequence-dependent setup times using a randomized search heuristic

    Publication Year: 2009, Page(s):28 - 33
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1287 KB) | HTML iconHTML

    This paper considers the problem of scheduling a set of jobs on both a single machine and identical parallel machines with the objective of minimizing the makespan or maximum completion time of all jobs. Jobs are subject to release dates and there are sequence-dependent setup times. Since this problem is known to be strongly NP-hard even for the single machine case, this paper proposes a heuristic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying an integer Electromagnetism-like algorithm to solve the cellular manufacturing scheduling problem with an integrated approach

    Publication Year: 2009, Page(s):34 - 39
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1868 KB) | HTML iconHTML

    In the past two decades many manufacturing companies applied Cellular Manufacturing Systems (CMS) to improve their production. Cellular manufacturing (CM) is recognized as an application of Group Technology (GT). This paper deals with CM scheduling problem which is considered as a major challenge in implementation of the CMS. Through previous studies many researchers have attempted to develop effe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A heuristic algorithm for integrated scheduling problem of container handling system

    Publication Year: 2009, Page(s):40 - 45
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3894 KB) | HTML iconHTML

    The integrated scheduling problem of the container handling system in container terminals is presented as a mixed integer programming model with the predefined operation constraints, sequence depended setup time and interference constraints for quay cranes. Based on the characteristics of container terminal operations, a heuristic algorithm is developed to solve this problem under the condition th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling two-machine flow shop with a batch processing machine

    Publication Year: 2009, Page(s):46 - 51
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1130 KB) | HTML iconHTML

    This paper deals with the two-machine flow shop scheduling problem in which the first machine is a batch processing machine (BPM) that can process a number of jobs simultaneously, while the second machine is a discrete processing machine (DPM) that processes jobs one by one. To minimize makespan of the system, we present a mixed integer programming formulation for the problem. Using this formulati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The joint replenishment and delivery scheduling involving multiple suppliers offering different quantity discounts

    Publication Year: 2009, Page(s):52 - 56
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2829 KB) | HTML iconHTML

    This paper deals with the joint replenishment and delivery scheduling problem of a warehouse. This problem includes in selecting any suppliers offering different quantity discounts as well as in determining the joint replenishment schedules and the outbound delivery schedules of a warehouse. The objective is to minimize the total relevant cost which is composed of the sum of major and minor orderi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mathematical model for training scheduling in incubators

    Publication Year: 2009, Page(s):57 - 61
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB) | HTML iconHTML

    This paper presents a mathematical model for training scheduling for small and medium enterprises (SMEs) in incubators. Based on the proposed model, each training program is specified to be held in the most suitable time by considering the SMEs' requirements and some other logical constraints. Construction of the proposed model is illustrated in details and its implementation is demonstrated via a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Project scheduling under resource constraints: Application of the cumulative global constraint

    Publication Year: 2009, Page(s):62 - 67
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1817 KB) | HTML iconHTML

    This paper concerns project scheduling under resource constraints. The objective is to find a solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. The problem under consideration is modelled as a constraint satisfaction problem (CSP). It is implemented under the constraint programming language CHIP V5. For modelling the resource co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel initialization method for solving Flexible Job-shop Scheduling Problem

    Publication Year: 2009, Page(s):68 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2103 KB) | HTML iconHTML

    A novel initialization method was proposed for genetic algorithm (GA) to generate high-quality initialization population so as to solve flexible job-shop scheduling problem (FJSP). The novel initialization method consists of two sub-methods: global selection (GS) and local selection (LS). GS is used to find different initial assignments in different runs of the algorithm, and to enhance the capabi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic handling time

    Publication Year: 2009, Page(s):74 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4080 KB) | HTML iconHTML

    For a container terminal system, efficient berth and quay crane (QC) schedules have great impact on the improvement of both operation efficiency and customer satisfaction. In this paper we address both berth and quay crane scheduling problems in a simultaneous way, with uncertainty of container handling time. The berth is of discrete type and vessels arrive dynamically with different service prior... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.