Coupled task scheduling with exact delays: Literature review and models

Abstract The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available mathematical models with a view to facilitating future research on the solution methods.

[1]  Reinhard Bürgy,et al.  Optimal job insertion in the no-wait job shop , 2012, Journal of Combinatorial Optimization.

[2]  A. K. Shahani,et al.  Modelling for the control of a complex radar system , 1998, Comput. Oper. Res..

[3]  Roy D. Shapiro,et al.  Scheduling coupled tasks , 1980 .

[4]  Jacek Blazewicz,et al.  New algorithms for coupled tasks scheduling - a survey , 2012, RAIRO Oper. Res..

[5]  Ali Allahverdi,et al.  A survey of scheduling problems with no-wait in process , 2016, Eur. J. Oper. Res..

[6]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[7]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[8]  Imen Hamdi.  Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness , 2014, Int. J. Comb. Optim. Probl. Informatics.

[9]  Gerd Finke,et al.  Scheduling of coupled tasks and one-machine no-wait robotic cells , 2009, Comput. Oper. Res..

[10]  Joseph Y.-T. Leung,et al.  Scheduling Two-Machine Flow shops with Exact Delays , 2007, Int. J. Found. Comput. Sci..

[11]  Gerd Finke,et al.  Identical coupled task scheduling: polynomial complexity of the cyclic case , 2015, J. Sched..

[12]  Heinz Gröflin,et al.  Feasible insertions in job shop scheduling, short cycles and stable sets , 2007, Eur. J. Oper. Res..

[13]  Han Hoogeveen,et al.  Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..

[14]  Steef L. van de Velde,et al.  Polynomial-time approximation schemes for scheduling problems with time lags , 2010, J. Sched..

[15]  Chengbin Chu,et al.  Single Machine Scheduling with Chain Structured Precedence Constraints and Separation Time Windows , 2004 .

[16]  Mourad Boudhar,et al.  Chain-reentrant shop with an exact time lag: new results , 2017, Int. J. Prod. Res..

[17]  H. Sherali,et al.  Interleaving two-phased jobs on a single machine , 2005, Discret. Optim..

[18]  Klaus H. Ecker,et al.  Complexity of scheduling of coupled tasks with chains precedence constraints and any constant length of gap , 2012, J. Oper. Res. Soc..

[19]  Alexander A. Ageev,et al.  Approximation Algorithms for Scheduling Problems , 2009, Introduction to Scheduling.

[20]  Haibing Li,et al.  Minimizing total completion time in two-machine flow shops with exact delays , 2009, Comput. Oper. Res..

[21]  Reinhard Bürgy,et al.  The no-wait job shop with regular objective: a method based on optimal job insertion , 2015, J. Comb. Optim..

[22]  Gerhard Reinelt,et al.  A branch-and-bound algorithm for the coupled task problem , 2014, Math. Methods Oper. Res..

[23]  A. Farina,et al.  Multitarget interleaved tracking for phased-array radar , 1980 .

[24]  N. V. Shakhlevich,et al.  Scheduling patient appointments via multilevel template: A case study in chemotherapy , 2014 .

[25]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[26]  A. Ageev,et al.  Approximation Algorithms for Scheduling Problems with Exact Delays , 2006, WAOA.

[27]  Gerhard Reinelt,et al.  Improved analysis of an algorithm for the coupled task problem with UET jobs , 2009, Oper. Res. Lett..

[28]  Alexander A. Ageev,et al.  Approximating Coupled-Task Scheduling Problems with Equal Exact Delays , 2016, DOOR.

[29]  Chris N. Potts,et al.  Scheduling of coupled tasks with unit processing times , 2010, J. Sched..

[30]  Natalia V. Shakhlevich,et al.  Scheduling coupled-operation jobs with exact time-lags , 2012, Discret. Appl. Math..

[31]  Krzysztof Giaro.  NP-hardness of compact scheduling in simplified open and flow shops , 2001, Eur. J. Oper. Res..

[32]  Jean-Claude König,et al.  Complexity and approximation for scheduling problem for a torpedo , 2009, 2009 International Conference on Computers & Industrial Engineering.

[33]  Feng Chu,et al.  Bi-objective optimization of a reentrant flow shop scheduling with exact time lag considering energy cost , 2017 .

[34]  Ammar Oulamara,et al.  Permutation flow shops with exact time lags to minimise maximum lateness , 2009 .

[35]  Chris N. Potts,et al.  Scheduling for a multifunction phased array radar system , 1996 .

[36]  A. J. Orman,et al.  On the Complexity of Coupled-task Scheduling , 1997, Discret. Appl. Math..

[37]  Mauro Dell'Amico,et al.  Shop Problems With Two Machines and Time Lags , 1996, Oper. Res..

[38]  Ammar Oulamara,et al.  Two-machine flowshop scheduling problem with coupled-operations , 2018, Ann. Oper. Res..

[39]  Ammar Oulamara,et al.  Two-machine flowshop scheduling problem with coupled-operations , 2018, Annals of Operations Research.

[40]  Philippe Baptiste,et al.  A note on scheduling identical coupled tasks in logarithmic time , 2010, Discret. Appl. Math..

[41]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[42]  Jean-Claude König,et al.  Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor , 2009, J. Sched..

[43]  L. G. Mitten.  Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[44]  Hanif D. Sherali,et al.  Radar pulse interleaving for multi‐target tracking , 2004 .

[45]  Hans Röck,et al.  Some new results in flow shop scheduling , 1984, Z. Oper. Research.

[46]  Bertrand M. T. Lin,et al.  Coupled-task scheduling on a single machine subject to a fixed-job-sequence , 2011, Comput. Ind. Eng..

[47]  Gerhard Reinelt,et al.  An exact algorithm for scheduling identical coupled tasks , 2004, Math. Methods Oper. Res..

[48]  Chris N. Potts,et al.  Heuristics for a coupled-operation scheduling problem , 2007, J. Oper. Res. Soc..

[49]  Alexander A. Ageev.  Approximating the 2-machine flow shop problem with exact delays taking two values , 2020, J. Glob. Optim..

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

[51]  Jean-Claude König,et al.  Some complexity and approximation results for coupled-tasks scheduling problem according to topology , 2016, RAIRO Oper. Res..

[52]  Rodolphe Giroudeau,et al.  Parameterized complexity of a coupled-task scheduling problem , 2018, Journal of Scheduling.

[53]  Haibing Li,et al.  Scheduling Coupled-Tasks on a Single Machine , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[54]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[55]  Gilles Simonin,et al.  Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks , 2013 .

[56]  A. Izquierdo-Fuente,et al.  Optimal radar pulse scheduling using a neural network , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[57]  Nasser Salmasi,et al.  Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem , 2013, Comput. Ind. Eng..

[58]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[59]  Mourad Boudhar,et al.  Two machines flow shop with reentrance and exact time lag , 2016, RAIRO Oper. Res..