Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 152, Issue 1, Pages 1-13Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00909-8
Keywords
survey; scheduling; sequencing; time dependence; computational complexity
Ask authors/readers for more resources
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. (C) 2003 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available