A Concise Survey of Scheduling with Time-Dependent Processing Times
We consider a class of machine scheduling problems in which the processing time of a task is dependent on its starting time in a schedule. On reviewing the literature on this topic, we provide a framework to illustrate how models for this class of problems have been generalized from the classical scheduling theory. A complexity boundary is presented for each model and related existing results are consolidated. We also introduce some enumerative solution algorithms and heuristics and analyze their performance. Finally, we suggest a few interesting areas for future research
Survey, Scheduling, Sequencing, Time dependence, Computational complexity
Business Administration, Management, and Operations
European Journal of Operational Research
Cheng, T. C. E.; DING, Qing; and Lin, B. M. T..
A Concise Survey of Scheduling with Time-Dependent Processing Times. (2004). European Journal of Operational Research. 152, (1), 1-13. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/328