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

@inproceedings{Lawrence2003HeuristicO,
  title={Heuristic , optimal , static , and dynamic schedules when processing times are uncertain},
  author={Stephen R. Lawrence and Edward C. Sewell},
  year={2003}
}
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… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS