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

Gupta, 1988, Single facility scheduling with nonlinear processing times, Computers and Industrial Engineering, 14, 387, 10.1016/0360-8352(88)90041-1

Browne, 1990, Scheduling deteriorating jobs on a single processor, Operations Research, 38, 495, 10.1287/opre.38.3.495

Cheng, 2000, Single machine scheduling with deadlines and increasing rates of processing times, Acta Informatica, 36, 673, 10.1007/s002360050170

Kononov AV. Scheduling problems with linear increasing processing times. Operations Research Proceedings 1996: Selected Papers of the Symposium on Operations Research (SOR ‘96), Braunschweig, September 3–6, 1996. Berlin: Springer, 1997, pp. 208–12.

Ho, 1993, Complexity of scheduling tasks with time-dependent execution times, Information Processing Letters, 48, 315, 10.1016/0020-0190(93)90175-9

Cheng, 1999, The time dependent machine makespan problem is strongly NP-complete, Computers and Operations Research, 26, 749, 10.1016/S0305-0548(98)00093-8

Cheng, 1998, The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times, Computers and Mathematics with Applications, 35, 95, 10.1016/S0898-1221(98)00099-6

Woeginger, 1995, Scheduling with time dependent execution times, Information Processing Letters, 54, 155, 10.1016/0020-0190(95)00011-Z

Chen, 1995, A note on single-processor scheduling with time-dependent execution times, Operations Research Letters, 17, 127, 10.1016/0167-6377(94)00058-E

Alidaee, 1999, Scheduling with time dependent processing times: review and extensions, Journal of the Operational Research Society, 50, 711, 10.1057/palgrave.jors.2600740