Of the p excellent continuations, q (first) operations are scheduled. This offers p latest partial schedules. After that step 1 is repeated.
These steps' details are detailed in the subsequent discussion as:
Generation of Continuation
This is crucial to employs a strategy that makes sure that in one continuation step operations are scheduled on each or in any case most machines. Or else, the evaluation of the optional schedules becomes very complicated. The algorithm proceeds as given below:
This procedure permits the construction of many continuations of length L, Computer Algorithm for On-line Scheduling for Automated Manufacturing Systems
1 ≤ L ≤ M, till all operations in S′ (m*) are utilized as early operations and all combination of operations in the sets S″(m*) for this initial operation has been produced. This process is iterated till all generated continuations have a specific length.