Heuristic, optimal, static, and dynamic schedules when processing times are uncertain

It is demonstrated that simple dispatch heuristics provide performance comparable or superior to that of algorithmically more sophisticated scheduling policies as processing time uncertainty grows.

Abstract

Abstract In this paper we compare the static and dynamic application of heuristic and optimal solution methods to job‐shop scheduling problems when processing times are uncertain. Recently developed optimizing algorithms and several heuristics are used to evaluate 53 standard job‐shop scheduling problems with a makespan objective when job processing times are known with varying degrees of uncertainty. Results indicate that fixed optimal sequences derived from deterministic assumptions quickly deteriorate with the introduction of processing time uncertainty when compared with dynamically updated heuristic schedules. As processing time uncertainty grows, we demonstrate that simple dispatch heuristics provide performance comparable or superior to that of algorithmically more sophisticated scheduling policies.