摘要
Hybrid flow shops can be encountered in various industrial settings. In this paper we develop methods for scheduling hybrid flow shops with hard time windows. Specifically, we study a two-stage hybrid flow shop scheduling problem with time windows to minimize the total weighted completion times. Each stage consists of one or more identical parallel machines, and each job visits two processing stages in series. Finding a feasible schedule with hard time windows is a challenging task in this setting, because it is NP-complete in the strong sense even for a single machine in a single stage. We propose two matheuristics to find an initial feasible solution by local branching. We also develop two schedule improvement procedures, one based on stage-by-stage decomposition, and one using adapted local branching. The performance of our methods is validated via extensive computational experiments.
学科与关键词
- The hybrid flow shop scheduling problemRuiz, Ruben*; Antonio Vazquez-Rodriguez, JoseEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205(1): 1-18.被引 574
- 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
- Two-stage no-wait hybrid flow-shop scheduling with sequence-dependent setup timesWang, Shijin; Wang, Xiaodong*; Yu, LiINTERNATIONAL JOURNAL OF SYSTEMS SCIENCE-OPERATIONS & LOGISTICS, 2020, 7(3): 291-307.被引 12
