Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31768
Title: A concise survey of scheduling with time-dependent processing times
Authors: Cheng, TCE 
Ding, Q
Lin, BMT
Keywords: Computational complexity
Scheduling
Sequencing
Survey
Time dependence
Issue Date: 2004
Publisher: Elsevier
Source: European journal of operational research, 2004, v. 152, no. 1, p. 1-13 How to cite?
Journal: European journal of operational research 
Abstract: 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.
URI: http://hdl.handle.net/10397/31768
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/S0377-2217(02)00909-8
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

472
Last Week
0
Last month
4
Citations as of Sep 8, 2017

WEB OF SCIENCETM
Citations

413
Last Week
1
Last month
1
Citations as of Sep 13, 2017

Page view(s)

71
Last Week
3
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.