Coupled-task scheduling on a single machine subject to a fixed-job-sequence

This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact delay. The objective of this study is to schedule the tasks to minimize the makespan subject to a given job sequence. We introduce several intriguing properties of the fixed-job-sequence problem under study. While the complexity status of the studied problem remains open, an O(n^2) algorithm is proposed to construct a feasible schedule attaining the minimum makespan for a given permutation of 2n tasks abiding by the fixed-job-sequence constraint. We investigate several polynomially solvable cases of the fixed-job-sequence problem and present a complexity graph of the problem.

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

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

[3]  Bertrand M. T. Lin,et al.  Makespan minimization in the two‐machine flowshop batch scheduling problem , 2000 .

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

[5]  Vitaly A. Strusevich,et al.  The open shop scheduling problem with a given sequence of jobs on one machine , 1998 .

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

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

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

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

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

[11]  C. T. Ng,et al.  Batching and scheduling in a multi-machine flow shop , 2007, J. Sched..

[12]  Bertrand M. T. Lin,et al.  Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type , 2011, Inf. Process. Lett..

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

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

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