Scheduling Tasks:

Definitions:

A processor, such as person, machine, can work on a series of tasks.

A machine-scheduling problem is to decide how the tasks should be scheduled.

A priority list is a list of ordering tasks according to some criterion of importance.

An order-requirement digraph shows which tasks precede other tasks among the collection of tasks making up a job.

Steps: make a PL: Priority List

1. Make Lists of all paths and their time totals
2. Start a Priority List : PL =
3. The highest total path is your critical path AND the 'lead' task on this path will be the top priority
4. Place this task on the PL
5. It has been assigned, so cross it off and subtract its' time from any paths it is in.
6. Should a TIE occur between paths- take the lowest numbered task.
7. Should you have duplicate paths- cancel one of them.

Now assign Tasks to your Processors, using **BOTH** your PL and your order Requirement Diagraph

Example 6. The order-requirement digraph is given.