Priority Scheduling

Here, the processing of operations is simulated starting with a time on the “clock” and incrementing the “clock” following the forecasted events that affect the workshop.

When, on a given date, several jobs are waiting in front of the work centers and only one machine is available, the priority rule is applied to determine which to sequence on the machine.

The system proposes twelve priority rules:

      1-FIFO
First come, first served

      2-LIFO
Last come, first served

      3- Shortest Operating time
Amongst all the waiting operations, the operation that has the shortest total time (set-up time plus processing time) is sequenced.

      4- Longest Operating time
Amongst all the waiting operations, the operation with the longest completion time (set-up plus processing time) is sequenced first.

      5- Minimum remaining operations
The WO with the fewest remaining operations to process is selected.

      6- Minimum remaining work hours
The WO with the least amount of remaining total work time is selected.

      7- Minimum Slack
The WO with the least Slack (number of hours available until the due date minus the remaining processing time) is selected.

      8- Minimum Slack / number of remaining operations
The WO that has the lowest ratio of slack to remaining number of operations is selected.

      9- Minimum Slack / remaining work hours
The WO that has the lowest ratio of slack to process time is selected.

      10- Shortest next queue
The WO that must be sequenced on the work center with the shortest queue is selected.

      11- Least loaded Next work center
The WO that must be sequenced on the work center with the smallest waiting load is selected.

      12- Random
A WO is selected from the queue randomly.

A priority rule must be chosen from the pull-down list. To start the scheduling procedure, click on OK. During the scheduling procedure, the released operations are sequenced in priority on the machine in hand.

If the Overlapping planning option is activated, the finite capacity scheduling procedure will also use the overlapping.

When the scheduling is finished, the machine schedule is displayed, as well as the results sorted by WO and the time evolution of the queues in front of the different work centers.