Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

In this paper, we study the feasibility problem of scheduling a set of start time dependent tasks on a single machine with deadlines, processing rates and identical initial processing times. First, we show that the cases with arbitrary deadlines are strongly NP-complete. Second, we show that the cases with two distinct deadlines are NP-complete in the ordinary sense. Finally, we give an optimal polynomial algorithm for the makespan problem with two distinct processing rates. We solve a series of open problems in the literature and give a sharp boundary delineating the complexity of the problems.

[1]  Zhi-Long Chen,et al.  A note on single-processor scheduling with time-dependent execution times , 1995, Oper. Res. Lett..

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

[3]  T.C.E. Cheng,et al.  The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times , 1998 .

[4]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Tasks with Time-Dependent Execution Times , 1993, Inf. Process. Lett..

[5]  Alexander V. Kononov,et al.  Scheduling Problems with Linear Increasing Processing Times , 1997 .

[6]  Gerhard J. Woeginger,et al.  Scheduling with Time-Dependent Execution Times , 1995, Inf. Process. Lett..

[7]  U. Zimmermann.  Operations research proceedings 1996 : selected papers of the Symposium on Operations Research (SOR'96), Braunschweig, September 3-6, 1996 , 1997 .

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

[9]  T. C. Edwin Cheng,et al.  Single machine scheduling with deadlines and increasing rates of processing times , 2000, Acta Informatica.

[10]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[11]  V. Tanaev,et al.  Scheduling theory single-stage systems , 1994 .

[12]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

[13]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[14]  T. C. E. Cheng,et al.  The time dependent machine makespan problem is strongly NP-complete , 1999, Comput. Oper. Res..