Single Machine Scheduling Subject To Precedence Delays

Abstract A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine in such a way that the makespan is minimized. The executions of the tasks are constrained by precedence delays, i.e., a task can start its execution only after any of its predecessors has completed and the delay between the two tasks has elapsed. In the case of unit execution times and integer lengths of delays, the problem is shown to be NP-hard in the strong sense. In the case of integer execution times and unit length of delays, the problem is polynomial, and an O(n2) optimal algorithm is provided. Both preemptive and non-preemptive cases are considered.

[1]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[3]  B. J. Lageweg,et al.  Multiprocessor scheduling with communication delays , 1990, Parallel Comput..

[4]  Stéphane Dauzère-Pérès,et al.  Integration of lotsizing and scheduling decisions in a job-shop , 1994 .

[5]  Egon Balas,et al.  One Machine Scheduling With Delayed Precedence Constraints. , 1993 .

[6]  Zhen Liu,et al.  Scheduling of Parallel Programs in Single-Bus Multiprocessor Systems , 1994 .

[7]  M. D. Wilkinson,et al.  Management science , 1989, British Dental Journal.

[8]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[9]  P Dileepan,et al.  Bicriterion static scheduling research for a single machine , 1988 .

[10]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[11]  Shigeji Miyazaki.  ONE MACHINE SCHEDULING PROBLEM WITH , 1981 .

[12]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[13]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Jerzy Kyparisis,et al.  Single machine scheduling research , 1987 .

[16]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[17]  W. A. Horn.  Some simple scheduling algorithms , 1974 .