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

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

0.00 Avg rating0 Votes
Article ID: iaor1998750
Country: United States
Volume: 15
Issue: 1
Start Page Number: 71
End Page Number: 82
Publication Date: Feb 1997
Journal: Journal of Operations Management
Authors: ,
Keywords: heuristics
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 with or superior to that of algorithmically more sophisticated scheduling policies.

Reviews

Required fields are marked *. Your email address will not be published.