Srheduling Iasks:

Definitions:

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

A machinescheduling probiem is to deside hove the lasks shauld be scheduled.

A prionity list is a lis$1$ of or dering tasks according to some criterion of impnetance.

An order$-$requirement digraph shows whish lasks precede other tasks amang the rallection of tasis making up a job.

Steps: make a PL: Priority List

Make Lists of ail paths and meii lime tatais

Srart a Priority tist: $PL=$

The highest total path is you cnstal path And the lead' task on this path will be the rop priscity

Place this task on the PL

It has been assigned, so cross it off and subtract its' timn from any paths it is in$.$

Should you have diuplitate pathis$-$cancel one of therm. bisgraph

Example $6.$ The order$-$requirement digraph is given.