[1] |
T.C.E. Cheng, Q. Ding, A survey on scheduling with time-dependent processing times, Working Paper, Faculty of Business and Information Systems, The Hong Kong Polytechnic University, Hong Kong, 1997 |

[2] |
Cheng, T. C. E.; Ding, Q.: The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times. Computers and mathematics with applications 35, 95-100 (1998) · Zbl 0992.90027 |

[3] |
Cheng, T. C. E.; Ding, Q.: The complexity of single machine scheduling with release times. Information processing letters 65, 75-79 (1998) |

[4] |
Cheng, T. C. E.; Ding, Q.: The time dependent machine makespan problem is strongly NP-complete. Computers and operations research 26, 749-754 (1999) · Zbl 0932.90013 |

[5] |
Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Kan, A. H. G. Rinooy: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of discrete mathematics 5, 287-326 (1976) · Zbl 0411.90044 |

[6] |
Garey, M. R.; Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completenes. (1979) · Zbl 0411.68039 |

[7] |
Kubiak, W.; Van De Velde, S. L.: Scheduling deteriorating jobs to minimize makespan. Naval research logistics 45, 511-523 (1998) · Zbl 0936.90026 |

[8] |
Mosheiov, G.: Scheduling jobs with step-deterioration: minimizing makespan on a single and multi-machine. Computers and industrial engineering 28, 869-879 (1995) |

[9] |
Sundararaghavan, P. S.; Kunnathur, A. S.: Single machine scheduling with start time dependent processing times: some solvable cases. European journal of operational research 78, 394-403 (1994) · Zbl 0816.90088 |