10.

1 Minimizing Makespan

le-machine model with n independent jobs with single

In
t h ebasic
operation, whatever be
e the
the sequence, the makespan will be the same. Hence, we concentrated on minimizing variousmayother
e , mean
flow time
time, mean tardiness, maximum tardiness, maximum flow time and number
e a s

oftardy jobs.
of the single machine model with
parallel processors, there will be m similar machines to
But in
nindependent
n independent
bs
jobs with single operation. Here, minimizing the makespan measure is no
ess
onger trivial.

McNaughton has proposed a method to schedule such jobs on m parallel machines when pre-
rion of jobs is allowed. If pre-emption of a scheduled job is allowed, the processing of the job
hich is scheduled beyond mean makespan on a machine is rescheduled to the next machine. This
whie
ne of assumption is valid if the set-up time of the jobs are insignificant when compared to their
ope of
processing times.

makespan (M) is computed by the following formula:

M =max {l/m 2 t, max (t))

j=

machines (processors) and

where , processing üme of the job j, m is the number of
is the parallel
n is the number of independent single operation jobs.

13.10.2 McNaughton's Algorithm (to minimize M with m parallel, identical machines)

An algorithm for scheduling n independent single operation jobs on m parallel machines is presented

below
and schedule it to machine-1 starting at time zero.
Step 1. Select any one job
and schedule it the same machine immediately after
Step 2. Choose any unscheduled job on

the previously scheduled job. Repeat this step until the processing of the current job goes beyond
M or until all the jobs are scheduled.
M to the machine,
Step 3. Reschedule the processing of the job which is scheduled beyond
next

Startng at time zero. Then, go to step 2.

xample 13.6. Consider the following set of jobs with three parallel processors (m = 3).

Job ) 2 3 4 5 6 7

2 3 4 5 6 6
Duration (t) 1

For this problem,

M = max (1/m E 1, max (t,))

= max [1/3 x 27, 6]

= [9, 6) = 9

For above problem, the schedule constructed as per McNaughton's method is shown in
Fig 13e
13.9