Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1030.90023
Cheng, T.C.E.; Ding, Q.; Lin, B.M.T.
A concise survey of scheduling with time-dependent processing times. (English)
[J] Eur. J. Oper. Res. 152, No.1, 1-13 (2004). ISSN 0377-2217

Summary: 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.

MSC 2000:: *90B35 Scheduling theory
90C60 Abstract computational complexity for math. programming problems
90C59 Approximation methods and heuristics
90-02 Research monographs (optimization)

Keywords: Survey; Scheduling; Sequencing; Time dependence; Computational complexity

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]