Case-based reactive scheduling

Scheduling of operations in a production process is usually seen as a combinatorial search for a feasible and perhaps optimal plan. In actual industrial practice however, constraints and optimization criteria can often not be given exactly because they are unknown or vague. Therefore a combinatorial approach often does not meet the actual requirements. Furthermore, the representation of all potential alternatives of the production process would lead to a combinatorial explosion that cannot be solved in a reasonable time frame.

[1]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[2]  Jürgen Dorn,et al.  Reactive Scheduling in a Fuzzy-Temporal Framework , 1993, Knowledge-Based Reactive Scheduling.

[3]  Jürgen Dorn,et al.  Iterative Improvement Methods for Knowledge-Based Scheduling , 1995, AI Commun..

[4]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[5]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[6]  Janet L. Kolodner,et al.  Case-Based Reasoning , 1989, IJCAI 1989.

[7]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[8]  Jürgen Dorn,et al.  Comparison of iterative improvement techniques for schedule optimization , 1996 .

[9]  Janet L. Kolodner,et al.  Case-Based Reasoning , 1988, IJCAI 1989.