Scheduling :Alternative terms

Loading is a planning methodology that is used to

assign an adequate number of jobs to the
resources in an operating system during a
planning horizon.

Scheduling is the process of rank ordering the

jobs in front of each resource to maximize some
chosen performance measure

Routing is the order in which the resources are

used by jobs for processing
 The Loading of Machines
M1 M2 M3 M4 M5
JOB1 15 17 16 22 18
JOB2 16 19 20 19 16
JOB3 19 20 17 19 20
JOB4 17 23 22 18 14
JOB5 20 19 24 16 17
 Flow Shop & Job Shop
J1 J2 Jn

M1 M2 Mm

In flow shop resources are organized one after another

in the order the job are processed
 In Job shop similar resources are grouped
together

M1

M2 M3

M4

M5
 Scheduling Rules
Shortest Processing Time(SPT): Rule chooses
the job with least processing time from
complete list and schedules it ahead of others.
JOB1,JOB2,JOB3,JOB4 with processing time
12,9,22,11 scheduling will be 2-4-1-3

Longest processing time (LPT) : reverse the

SPT i.e. 3-1-4-2
 Earliest due date(EDD) : Give priority on the basis
of the due date for the job.

Critical Ration(CR): Consider due date &

processing time both
CR =Remaining time /Remaining work
CR=Due date-Current date/Remaining
processing time

First come first served(FCFS)

Random order (RAN)