Flowshop Scheduling with Random and Bounded Setup Times
نویسندگان
چکیده
The two-machine permutation flowshop scheduling problem to minimize makespan or total completion time criterion is addressed where setup times are considered to be separate from processing times. Setup times are relaxed to be random variables as opposed to the common assumption in the literature that setup times are exactly known (deterministic) in advance. The probability distributions of setup times are unknown, and only the lower and upper bounds of setup times are given. In such cases, there may not exist a unique schedule that remains optimal for all possible realizations of setup times, and therefore, a set of schedules has to be considered which dominates all other schedules for the given makespan or total completion time criterion. Some sufficient conditions are obtained when transposition of jobs minimizes makespan or total completion time criterion.
منابع مشابه
Two-machine Flowshop Scheduling Problem to Minimize Makespan or Total Completion Time with Random and Bounded Setup Times
This paper addresses the two-machine flowshop scheduling problemwith separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are dev...
متن کاملA bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
متن کامل
Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملA Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملThree-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times
The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is a...
متن کامل