Incremental temporal reasoning in job shop scheduling repair

A working predictive schedule can be useless because of the various external or internal disruptions in a job shop. Total rescheduling may cause problems such as shop floor nervousness. Thus, the job shop scheduling repair (recovery) approach aims at generating a solution satisfying the updated constraints and making deviations minimized. We propose an incremental temporal reasoning approach in this paper to solve job shop scheduling repair problems. Specifically, such a problem is formulated as a disjunctive temporal problem (DTP), framed as an optimal constraint satisfaction problem (OCSP) formally, and finally solved by performing an algorithm integrating incremental temporal consistency and efficient candidate generation. Through involving human interactive mechanism, domain experts can make higher quality decisions by balancing makespan and deviations.

[1]  Mark Abramson,et al.  Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[2]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[3]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment , 1999 .

[4]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[5]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[6]  Jürgen Dorn,et al.  Case-based reactive scheduling , 1995 .

[7]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[8]  Jürgen Kletti,et al.  Manufacturing Execution Systems (MES) , 2007 .

[9]  Stephen F. Smith,et al.  Reactive Scheduling Systems , 1995 .

[10]  Robert T. Effinger,et al.  Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction , 2005, ICAPS.

[11]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[12]  Brian C. Williams,et al.  Model-based programming of intelligent embedded systems and robotic space explorers , 2003, Proc. IEEE.

[13]  Oliver Günther,et al.  RFID in manufacturing , 2008 .

[14]  Kazuo Miyashita,et al.  Case-based knowledge acquisition for schedule optimization , 1995, Artif. Intell. Eng..

[15]  G. Fozzard,et al.  Constraint-Based Reactive Rescheduling in a Stochastic Environment , 1997, ECP.

[16]  Velusamy Subramaniam,et al.  Reactive Recovery of Job Shop Schedules – A Review , 2002 .

[17]  Reha Uzsoy,et al.  Predictable scheduling of a single machine with breakdowns and sensitive jobs , 1999 .

[18]  Brian C. Williams,et al.  Conflict-directed A* and its role in model-based embedded systems , 2007, Discret. Appl. Math..

[19]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[20]  J. Efstathiou.  Anytime heuristic schedule repair in manufacturing industry , 1996 .

[21]  Dirk Braeken,et al.  Manufacturing execution system (MES) , 2005 .

[22]  Janet Efstathiou.  Formalising the Repair of Schedules Through Knowledge Acquisition , 1996, EKAW.