摘要
In this paper, a two-stage no-wait hybrid flow-shop scheduling problem is investigated in which the sequence-dependent setup time at the first stage is considered. The NP-hardness of the problem is first proven. A lower bound based on the Hungarian method is proposed. A branch-and-bound approach, a tabu search and three heuristic methods are developed for the problem. Extensive computational experiments are conducted to evaluate the performance of these methods. The computational results show the efficiency of the proposed methods.
学科与关键词
关键词
Schedulingtwo-stage hybrid flow shopsequence-dependent setup timesbranch-and-boundtabu search
- TWO-STAGE HYBRID FLOWSHOP SCHEDULING PROBLEM WITH INDEPENDENT SETUP TIMESJemmali, M.; Hidri, L.; Alourani, A.*International Journal of Simulation Modelling, 2022, 21(1): 5-16.被引 11
- Hybrid Flow Shop with Setup Times Scheduling ProblemJemmali, Mahdi*; Hidri, LotfiCOMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2023, 44(1): 563-577.被引 8
- Scheduling hybrid flow shops with time windowsYang, Fan; Leus, Roel*JOURNAL OF HEURISTICS, 2021, 27(1-2): 133-158.被引 3
