The aim of the paper is to present a conception of intelligent learning-based algorithms for scheduling. A general knowledge based model of a vast class of discrete deterministic processes is given. The model is a basis for the method of the synthesis of intelligent, learning-based algorithms, that is described in the paper. The designing simulation experiments that use learning is also described. To illustrate the presented ideas, the scheduling algorithm for a special NP-hard problem is given. The significant feature of the problem is that the retooling time depends not only on a pair of jobs to be processed directly one after the other, but also on the subset of jobs already performed. The proof of the NP-hardness of the problem is also given in the paper.
[1]
Philippe Vincke,et al.
Multicriteria Decision-Aid
,
1992
.
[2]
Judea Pearl,et al.
Heuristics : intelligent search strategies for computer problem solving
,
1984
.
[3]
Chandrasekharan Rajendran,et al.
A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
,
1994
.
[4]
Rainer Kolisch,et al.
Adaptive search for solving hard project scheduling problems
,
1996
.
[5]
Rainer Kolisch,et al.
Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
,
1995
.