New high performing heuristics for minimizing makespan in permutation flowshops
نویسندگان
چکیده
منابع مشابه
Minimizing makespan in hybrid flowshops
We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...
متن کاملMinimizing Makespan in Flowshops with Pallet Requirements
We treat the problem of scheduling a owshop with pallet requirements. Each job in the owshop needs a pallet the entire time, from the start of its rst operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by an integer K. We prove that the problem is NP-hard in the strong sense for m 2 and K 3, and for m 3 and K 2, where m is th...
متن کاملMinimizing Makespan in Flowshops with Bounded Processing Times
CT : The two-machine flowshop scheduling problem of minimizing makespan is addressed where jobs have rocessing times which are bounded within certain intervals. The probability distributions of job processing hin intervals are not known. The only known information about job processing times is the lower and upper he decision about a solution of the problem, i.e., finding a sequence, has to be m...
متن کاملComparison of heuristics for flowtime minimisation in permutation flowshops
We focus our attention on the problem of sequencing jobs in a permutation flow shop with the objective of minimising the sum of completion times or flowtime. This objective is considered to be more relevant and meaningful for today’s dynamic production environment, and therefore it has attracted the attention of researchers during the last years. As a result, a number of different types of heur...
متن کاملNew Heuristics for No-Wait Flowshops with Performance Measures of Makespan and Mean Completion Time
The m-machine no-wait flowshop scheduling problem is addressed by taking into account two performance measures of makespan and mean completion time. The objective is to minimize makespan such that mean completion time is less than a certain value. A dominance relation is provided for a special case of the problem. Moreover, two new heuristics are proposed in this paper. Computational analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2009
ISSN: 0305-0483
DOI: 10.1016/j.omega.2007.02.002