A note on improving the performance of the enhanced dynamic cycte lengths heuristic for the multi-item, single machine scheduling problem

Abstract

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.