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...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
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 |
id |
sg-smu-ink.lkcsb_research-1327 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.lkcsb_research-13272010-09-23T06:24:04Z A Concise Survey of Scheduling with Time-Dependent Processing Times Cheng, T. C. E. DING, Qing Lin, B. M. T. 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 2004-01-01T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/328 info:doi/10.1016/s0377-2217(02)00909-8 https://doi.org/10.1016/s0377-2217(02)00909-8 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Survey Scheduling Sequencing Time dependence Computational complexity Business Administration, Management, and Operations |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Survey Scheduling Sequencing Time dependence Computational complexity Business Administration, Management, and Operations |
spellingShingle |
Survey Scheduling Sequencing Time dependence Computational complexity Business Administration, Management, and Operations Cheng, T. C. E. DING, Qing Lin, B. M. T. A Concise Survey of Scheduling with Time-Dependent Processing Times |
description |
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 |
format |
text |
author |
Cheng, T. C. E. DING, Qing Lin, B. M. T. |
author_facet |
Cheng, T. C. E. DING, Qing Lin, B. M. T. |
author_sort |
Cheng, T. C. E. |
title |
A Concise Survey of Scheduling with Time-Dependent Processing Times |
title_short |
A Concise Survey of Scheduling with Time-Dependent Processing Times |
title_full |
A Concise Survey of Scheduling with Time-Dependent Processing Times |
title_fullStr |
A Concise Survey of Scheduling with Time-Dependent Processing Times |
title_full_unstemmed |
A Concise Survey of Scheduling with Time-Dependent Processing Times |
title_sort |
concise survey of scheduling with time-dependent processing times |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2004 |
url |
https://ink.library.smu.edu.sg/lkcsb_research/328 https://doi.org/10.1016/s0377-2217(02)00909-8 |
_version_ |
1770569534900535296 |