Loading…
A note on improving the performance of the enhanced dynamic cycte lengths heuristic for the multi-item, single machine scheduling problem
A comparison of different heuristics to schedule the multi-item, single-machine problem with stochastic, time-varying demands was previously performed by Gascon, Leachman and Lefran90is. In this note, we show how the performance of one of these heuristics, the Enhanced Dynamic Cycle Lengths heuristi...
Saved in:
Published in: | International journal of production research 1995-03, Vol.33 (3), p.869-873 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A comparison of different heuristics to schedule the multi-item, single-machine problem with stochastic, time-varying demands was previously performed by Gascon, Leachman and Lefran90is. In this note, we show how the performance of one of these heuristics, the Enhanced Dynamic Cycle Lengths heuristic, can be improved and thus dominate all the other heuristics in all the various test cases simulated. |
---|---|
ISSN: | 0020-7543 1366-588X |
DOI: | 10.1080/00207549508930183 |