Iterative Improvement Methods for Knowledge-Based Scheduling

  title={Iterative Improvement Methods for Knowledge-Based Scheduling},
  author={J{\"u}rgen Dorn},
  journal={AI Commun.},
  • J. Dorn
  • Published 1995
  • Computer Science
  • AI Commun.
For large industrial applications the constraint-based formulation of scheduling problems fits better than mathematical representations from Operational Research, because the constraint approach is more flexible and can be adapted more easily to organizational changes in the production. However, the search for a good solution for realistic applications can be very expensive and furthermore, in scheduling one is not only interested in a feasible solution but also in an optimized solution.In this… 

Figures from this paper

Reactive scheduling: improving the robustness of schedules and restricting the effects of shop floor disturbances by fuzzy reasoning

It is shown how, on one side, fuzzy logic can be used to support the construction of schedules that are robust with respect to changes due to certain types of event, and how a reaction can be restricted to a small environment by means of fuzzy constraints and a repair-based problem-solving strategy.

Knowledge-Based Systems Techniques and Applications in Scheduling

In this chapter an overview of scheduling problems, techniques to solve scheduling problem, scheduling systems as well as research issues in scheduling is given.


Preliminary empirical investigations using the WAS prototype system on historical data indicates a high potential for improvement, although the current system is based on relatively straightforward heuristics and no automatic optimization facilities.

Modeling and solving multi-site scheduling problems

Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of the other sites to manufacture

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

Business Service Scheduling

  • J. Dorn
  • Business
    Int. J. Appl. Logist.
  • 2010
A method for service scheduling and optimization based on an ontology to describe business services and related concepts is proposed and a near-optimal solution of the service scheduling problem is achieved.

Integrating transportation in a multi-site scheduling environment

  • J. SauerH. Appelrath
  • Business
    Proceedings of the 33rd Annual Hawaii International Conference on System Sciences
  • 2000
This work describes how transportation tasks can be modeled as a scheduling problem and which kind of solution strategies are appropriate and how the temporal restrictions of meeting the delivery dates here are the most important goals.


A research project based in France is developing a decision support system for railway traffic control centers. A specific goal of the project is to develop different models of train circulation



A flow shop with compatibility constraints in a steelmaking plant

We present a scheduling methodology for applications where the generation of schedules is constrained by antagonistic and vague knowledge. Besides temporal and capacity constraints, compatibility

Diagnosing and Solving Over-Determined Constraint Satisfaction Problems

The resulting method, DOC, an abbreviation for Diagnosis of Over-determined Constraint Satisfaction Problems, identifies the set of least important constraints that should be relaxed to solve the remaining constraint satisfaction problem.

Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method

A theoretical analysis is presented to explain why the heuristic method for solving large-scale constraint satisfaction and scheduling problems works so well on certain types of problems and to predict when it is likely to be most effective.

Look-ahead techniques for micro-opportunistic job shop scheduling

This dissertation demonstrates that the granularity of the subproblems selected by the backtrack search procedure critically affects both the efficiency of the procedure and the quality of the resulting solution, thereby demonstrating the superiority of a micro-opportunistic approach to job shop scheduling over coarser search procedures such as those implemented in ISIS, OPT, and OPIS.

Focused simulated annealing search: An application to job shop scheduling

The meta-heuristic procedure developed to solve job shop scheduling problems simultaneously subject to tardiness and inventory costs is shown to significantly increase schedule quality compared to multiple combinations of dispatch rules and release policies, though at the expense of intense computational efforts.

Constraint-Directed Search: A Case Study of Job-Shop Scheduling

In this thesis, a system called ISIS is presented, which uses a constraint-directed search paradigm to solve the scheduling problem and provides a knowledge representation language for modeling organizations and their constraints.

Tabu search methods for a single machine scheduling problem

This paper considers the use of three local search strategies within a tabu search (TS) method for the approximate solution of a single machine scheduling problem and constructs a TS method that employs both swap and insert moves.