A Concise Survey of Scheduling with Time-Dependent Processing Times

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 sc...

Full description

Saved in:
Bibliographic Details
Main Authors: Cheng, T. C. E., DING, Qing, Lin, B. M. T.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2004
Subjects:
Survey
Scheduling
Sequencing
Time dependence
Computational complexity
Business Administration, Management, and Operations
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/328
https://doi.org/10.1016/s0377-2217(02)00909-8
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
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

Similar Items