Scheduling hybrid flow shops with time windows

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.

[1]  G. M. Komaki,et al.  Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems , 2016 .

[2]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[3]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling surface mount technology lines , 2001 .

[4]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[5]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[6]  Mohamed Haouari,et al.  Optimal Scheduling of a Two-stage Hybrid Flow Shop , 2006, Math. Methods Oper. Res..

[7]  Xianpeng Wang,et al.  An Improved Particle Swarm Optimization Algorithm for the Hybrid Flowshop Scheduling to Minimize Total Weighted Completion Time in Process Industry , 2010, IEEE Transactions on Control Systems Technology.

[8]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[9]  Fabrice Talla Nobibon,et al.  Exact algorithms for single-machine scheduling with time windows and precedence constraints , 2015, Journal of Scheduling.

[10]  Chelliah Sriskandarajah,et al.  Parallel machine scheduling with a common server , 2000, Discret. Appl. Math..

[11]  R. Leus,et al.  Practical Solutions for a Dock Assignment Problem with Trailer Transportation , 2011 .

[12]  Rong-Hwa Huang,et al.  Ant colony system for job shop scheduling with time windows , 2008 .

[13]  Nathan Huynh,et al.  Integrated quay crane and yard truck scheduling for unloading inbound containers , 2015 .

[14]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[15]  Heinrich Kuhn,et al.  A taxonomy of flexible flow line scheduling procedures , 2007, Eur. J. Oper. Res..

[16]  Mitsuo Gen,et al.  Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints , 2017, J. Intell. Manuf..

[17]  Roel Leus,et al.  Practical Solutions for a Dock Assignment Problem with Trailer Transportation , 2011, Eur. J. Oper. Res..

[18]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[19]  Hatem Hadda,et al.  Exact resolution of the two-stage hybrid flow shop with dedicated machines , 2014, Optim. Lett..

[20]  Quan-Ke Pan,et al.  An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling , 2016, Eur. J. Oper. Res..

[21]  June-Young Bang,et al.  Scheduling algorithms for a semiconductor probing facility , 2011, Comput. Oper. Res..

[22]  Frits C. R. Spieksma,et al.  Optimal solutions for a dock assignment problem with trailer transportation , 2010, Annals of Operations Research.

[23]  Matteo Fischetti,et al.  Repairing MIP infeasibility through local branching , 2008, Comput. Oper. Res..

[24]  Suna Kondakci Köksalan,et al.  A flexible flowshop problem with total flow time minimization , 2001, Eur. J. Oper. Res..

[25]  George L. Vairaktarakis,et al.  Integrated Scheduling of Production and Distribution Operations , 2005, Manag. Sci..

[26]  Leyuan Shi,et al.  Dual constrained single machine sequencing to minimize total weighted completion time , 2005, IEEE Transactions on Automation Science and Engineering.

[27]  Lixin Tang,et al.  A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry , 2007, Comput. Oper. Res..

[28]  S. S. Panwalkar,et al.  Sequencing Research and the Industrial Scheduling Problem , 1973 .

[29]  Mario Vanhoucke,et al.  A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem , 2007, Oper. Res..

[30]  Rasaratnam Logendran,et al.  A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect , 2018 .

[31]  Michel Minoux,et al.  A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints , 2012, Comput. Oper. Res..

[32]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[33]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[34]  Jean-Charles Billaut,et al.  Total completion time minimization in a computer system with a server and two parallel processors , 2005, Comput. Oper. Res..

[35]  Egon Balas,et al.  Job Shop Scheduling With Deadlines , 1998, J. Comb. Optim..

[36]  Andreas Klemmt,et al.  Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[37]  G.-C. Lee,et al.  A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness , 2004 .

[38]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[39]  Egon Balas,et al.  Job shop scheduling with setup times, deadlines and precedence constraints , 2008, J. Sched..

[40]  Deming Lei,et al.  Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration , 2016, Comput. Oper. Res..

[41]  Norbert Trautmann,et al.  A continuous-time MILP model for short-term scheduling of make-and-pack production processes , 2013 .

[42]  Ming Liu,et al.  Scheduling a tempered glass manufacturing system: a three-stage hybrid flow shop model , 2017, Int. J. Prod. Res..

[43]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[44]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[45]  Mitsuo Gen,et al.  Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy , 2014 .

[46]  Sebastián Lozano,et al.  Production and delivery scheduling problem with time windows , 2005, Comput. Ind. Eng..

[47]  Shijin Wang,et al.  A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling , 2015 .

[48]  Vincent T'Kindt,et al.  Scheduling batches in flowshop with limited buffers in the shampoo industry , 2012, Eur. J. Oper. Res..

[49]  Quan-Ke Pan,et al.  Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows , 2017, Comput. Oper. Res..

[50]  John W. Fowler,et al.  A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines , 2018, J. Sched..

[51]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[52]  R. Kolisch,et al.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1996 .

[53]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[54]  John W. Fowler,et al.  Constraint Programming Approach for Scheduling Jobs With Release Times, Non-Identical Sizes, and Incompatible Families on Parallel Batching Machines , 2017, IEEE Transactions on Semiconductor Manufacturing.

[55]  Julia Rieck,et al.  Machine scheduling in underground mining: an application in the potash industry , 2016, OR Spectr..

[56]  Payman Jula,et al.  Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains , 2013 .

[57]  Federico Della Croce,et al.  A matheuristic approach for the two-machine total completion time flow shop problem , 2014, Ann. Oper. Res..

[58]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..