Minimizing makespan in a pallet-constrained flowshop
نویسندگان
چکیده
منابع مشابه
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 flowshop with time lags
We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags, denoted by Fm|θ, θ|Cmax. Time lag constraints generalize the classical precedence constraints between operations: minimal (respectively maximal) time lags indeed specify that the time elapsed between two operations must be lower(respectively upper-) bounded. We assume that such constraints ...
متن کاملMinimizing makespan on a two-machine re-entrant flowshop
This paper focuses on a two-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1, machine 2 and then machine 1 and machine 2. We develop dominance properties, lower bounds and heuristic algorithms for the problem, a...
متن کاملMinimizing makespan for a no-wait flowshop using genetic algorithm
This paper explains minimization of makespan or total completion time for n-jobs, m-machine, no-wait flowshop problem (NW-FSSP). A spread sheet based general purpose genetic algorithm is proposed for the NW-FSSP. The example analysis shows that the proposed approach produces results are comparable to the previous approaches cited in the literature. Additionally, it is demonstrated that the curr...
متن کاملA New Heuristic Method for Minimizing the Makespan in a No-idle Permutation Flowshop
This paper deals with the no-idle permutation flowshop sequencing in order to minimize the total time of completing the schedule (makespan). A heuristic denoted by NB is introduced, which is compared with the best heuristics reported in the literature. An extensive computational experiment was carried out for the performance evaluation of the proposed heuristic. Experimental results clearly sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 1999
ISSN: 1094-6136,1099-1425
DOI: 10.1002/(sici)1099-1425(199905/06)2:3<115::aid-jos20>3.0.co;2-u