《1999 An effective approach for job-shop scheduling with uncertain processing requirements》.pdf

328 IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 15, NO. 2, APRIL 1999 An Effective Approach for Job-Shop Scheduling with Uncertain Processing Requirements Peter B. Luh, Fellow, IEEE, Dong Chen, Student Member, IEEE, and Lakshman S. Thakur Abstract— Production systems often involve various uncertain- scheduled without considering possible orders in the future, ties such as unpredictable customer orders or inaccurate estimate new orders of significant urgency may interrupt those already of processing times. Managing such uncertainties is becoming scheduled, rendering their planned processes delayed. Since critical in the era of “time-based competition.” For example, if a schedule is generated without considering possible orders in the many manufacturing activities are now tightly coupled in a future, new orders of significant urgency may interrupt those complicated fashion, the delay of a single operation may have already scheduled, causing serious violation of their promised a domino effect, causing the delay of subsequent operations delivery dates. The consideration of uncertainties, however, has belonging to the same part and the delay of other parts been proven to be very difficult because of the combinatorial sharing the same machines. The consideration of uncertainties nature of discrete optimization compounded further by the pres- ence of uncertain factors. in scheduling, however, has been proved to be very difficult This paper presents an effective approach for job-shop sched- because of the combinatorial nature of discrete optimization uling considering uncertain arrival times, processi