UNIT III : SCHEDULING

Scheduling is the allocation of start and finish time to

each particular order.
Scheduling is done to complete different jobs using same
set of resources (machines) such that idle time of
machines are reduced.
The single machine scheduling problem consists of n jobs
with the same single operation on each of the jobs.
Flow shop scheduling problem consists of n jobs with m
operations on each of the jobs and all the jobs will have
same process sequences.
The job shop scheduling problem contains n jobs with m
operations on each of the jobs, but the process
sequences of the jobs will be different from each other.
UNIT III : SCHEDULING
Concept of Single Machine Scheduling
1. A set of independent, single operation jobs are
available for processing at time zero.
2. Set-up time of each job is independent of its position in
job sequence. So, set-up time of each job can be
included in its processing time.
3. One machine is continuously available and is never
kept idle when work is waiting.
4. Each job is processed till its completion without break.
5. 5=[3] means that the job 5 is assigned to the third
position in the sequence.
6. D
[4]
refers to the due date of the job assigned to the
fourth position in the sequence.
UNIT III : SCHEDULING
Processing time (t
j
) - Time required to process job j. The
processing time t
j
will normally include both actual
processing time and set-up time.
Ready time (r
j
) - It is the time at which job j is available
for processing. The ready time for a job is the difference
between the arrival time of that job and the time at which
that job is taken for processing. In the basic model,r
j
= 0 for
all jobs.
Due date (d
j
) - It is the time at which the job j is to be
completed.
Completion time (C
j
) - It is the time at which job j is
actually completed in a sequence
UNIT III : SCHEDULING
Flow time (F
j
) It is the amount of time job, j spends in
the system. Flow time is a measure which indicates the
waiting time of jobs in a system. It is difference between the
completion time and the ready time of the job j.
F
j
= C
j
r
j

Lateness (L
j
) - It is the amount of time by which the
completion time of job, j differs from the due date
(L
j
= C
j
d
j
). Lateness can be either positive or negative.
Positive lateness means that the job is completed after its
due date. Negative lateness means that the job is
completed before its due date.

UNIT III : SCHEDULING
Tardiness (T
j
) Tardiness is the lateness of the job, j if it fails to
meet its due date.
T
j
= max {0, (C
j
d
j
)}
= max {0, L
j
}
Measures of Performance
Mean flow time : F =
1
n
.F
j
, j= 1,2,3,.n
Mean Tardiness : T = =
1
n
. T
j
, j= 1,2,3,.n
Maximum Flow Time : F
max
= max {F
j
}, 1 j n
Maximum tardiness : T
max
= max {T
j
}, 1 j n
Number of tardy jobs : N
T
= f(T
j
) j= 1,2,3,.n
Where f(T
j
) = 1, if T
j
0, and
f(T
j
) = 0, otherwise

UNIT III : SCHEDULING
Makespan or Total Flow Time : Makespan is the total
amount of time required to complete a group of scheduled
jobs.
Makespan = Time of completion of last job - Starting time of Ist. job
Shortest processing time(SPT) rule to minimize Mean Flow
Time
In single machine scheduling problem, sequencing the
jobs in increasing order of processing time is known as
the shortest processing time (SPT) sequencing.
The time spent by a job in the system is nothing but its
flow time, and the rapid turnaround time is its mean
flow time(F). Shortest processing time (SPT) rule
minimizes the Mean Flow Time.

UNIT III : SCHEDULING
#1. Considering the following single machine scheduling problem,
(i)Find out the Job sequence which will minimize the Mean Flow Time
(ii)Find out the Optimal Mean Flow Time



Solution :
(i)Number of jobs = 5
Arrange the jobs as per SPT ordering as shown below :




The job sequence which will minimize the Mean Flow Time is
2-3-5-4-1
Job (j) 1 2 3 4 5
Processing time (t
j
) (hrs) 15 4 5 14 8
Job (j) 2 3 5 4 1
Processing time (t
j
) (hrs) 4 5 8 14 15
UNIT III : SCHEDULING
(ii)Computation of F
Min





F
j
= C
j
r
j

Since the ready time r
j
=0 for all j, the flow time, F
j
is equal
to C
j
for all value of j.
F= (F
j
)/n, j =1 to 5
=
(4:9:17:31:46)
5
= 21.4 hours
Therefore, optimal mean flow time = 21.4hours
Job (j) 2 3 5 4 1
Processing time(t
j
) 4 5 8 14 15
Completion time, C
j =
F
j
4 9 17 31 46
UNIT III : SCHEDULING
WSPT rule - In single machine scheduling problem, the jobs
are sequenced in increasing order of weighted processing
time known as weighted shortest processing time(WSPT)
sequencing. The weighted processing time of a job is
obtained by dividing its processing time by its weight.

Weighted Mean Flow Time
F
w
= (w
j
. F
j
)/(w
j
), j = 1 to n

UNIT III : SCHEDULING
#2.Consider the following single machine scheduling
problem with weights.




(i)Determine the sequence which will minimize the
weighted mean flow time of the above problem.
(ii)Calculate the weighted mean flow time
Job (j) 1 2 3 4 5
Processing time (t
j
) 15 4 5 14 8
Weight (w
j
) 1 2 1 2 3
UNIT III : SCHEDULING
Solution :






Next, arrange the jobs in the increasing order of t
j
/w
j
(i.e.
WSPT ordering).From the above Table, we get the following
relation
t
2
/w
2
t
5
/w
5
t
3
/w
3
t
4
/w
4
t
1
/w
1

2 - 5 - 3 - 4 - 1




Job (j) 1 2 3 4 5
Processing time (t
j
) 15 4 5 14 8
Weight (w
j
) 1 2 1 2 3
t
j
/w
j
15 2 5 7 2.67
UNIT III : SCHEDULING
Therefore, the optimal sequence which will minimize
the weighted mean flow time is 2-5-3-4-1
F
W
Calculation :





F
w
=
wj.Fj, for j=1 to n
wj, for j=1 to n
=
(8:36:17:62:46)
(2:3:1:2:1)
=
169
9
=18.78



Job (j) 2 5 3 4 1
Processing
time,t
j

4 8 5 14 15
C
j
= F
j
4 12 17 31 46
w
j
2 3 1 2 1
F
j
* w
j
8 36 17 62 46
UNIT III : SCHEDULING
Earliest Due Date (EDD) rule to minimize maximum
lateness
The lateness L
j
of a job is defined as the difference
between the completion time and the due date of that
job, L
j
= C
j
d
j

The maximum job lateness (L
max
) and the maximum job
tardiness (T
max
) are minimized by Earliest Due Date
sequencing.
In single machine scheduling problem, sequencing of jobs
in increasing order of due date is known as Earliest Due
Date rule.


UNIT III : SCHEDULING
#3.Consider the following single machine scheduling
problem




Determine the sequence which will minimize the maximum
lateness (L
max
). Also determine the L
max
with respect to
optimal sequence.





Job(j) 1 2 3 4 5 6
Processing time (t
j
) 10 8 8 7 12 15
Due date (d
j
) 15 10 12 11 18 25
UNIT III : SCHEDULING
Solution : Arrange the jobs as per EDD rule that is in the
increasing order of their Due Dates. The EDD sequence is :
2-4-3-1-5-6. This sequence gives the minimum value of L
max

Computation of L
max
:





From above Table, the maximum L
j
is 35. This is optimized (minimized)
Value for L
max
.





Job (j) [EDD sequence] 2 4 3 1 5 6
Processing time (t
j
) 8 7 8 10 12 15
Completion time (C
j
) 8 15 23 33 45 60
Due date (d
j
) 10 11 12 15 18 25
Lateness (L
j
) -2 4 11 18 27 35
UNIT III : SCHEDULING
Minimize Mean Flow Time for m similar machines to
process n independent jobs
Step 1 : Form SPT ordering of all the jobs
Step 2 : Select the job which is next in the ordered list and
schedule it to the machine with the least utilization(break
ties randomly). Repeat this step until all the jobs are
scheduled.
UNIT III : SCHEDULING
#4.Consider the following 8 jobs and find the schedule
which will minimize the mean flow time, if the number of
parallel identical machines are 2. How much is makespan?








Job (j) 1 2 3 4 5 6 7 8
Processing time
(t
j
)
4 6 3 7 2 1 5 9
UNIT III : SCHEDULING
Step 1. The SPT ordering of the job is : 6-5-3-1-7-2-4-8
Step 2. The construction of the schedule is summarized in the following Table :






INITIAL JOB LIST : 6 5 3 1 7 2 4 - 8
STAGE PROCESSING
COMMITMENTS
ASSIGNMENTS
M/C - 1 M/C - 2 JOB M/C No.
1 0 0 6 1
2 1 0 5 2
3 1 2 3 1
4 4 2 1 2
5 4 6 7 1
6 9 6 2 2
7 9 12 4 1
8 16 12 8 2
9 16 21 - -
UNIT III : SCHEDULING
The details of the above Table are summarized in the form of Gantt
Chart in Figure below. The make-span of this schedule is 21.

Machine-1
6 3 7 4

1 4 9 16

Machine-2 5 1 2 8


2 6 12 21






UNIT III : SCHEDULING
FLOW SHOP SCHEDULING
In flow-shop scheduling problem, there are n jobs and each requires
processing in m different machines. The flow-shop scheduling
problem can be characterized as follows :
1. A set of multiple operation jobs is available for processing at time
zero. Each job requires m operations and each operation requires a
different machine.
2. Set-up times for the operations are included in processing times
and are sequence independent.
3. m different machines are continuously available.
4. Each individual operation of jobs is processed till its completion
without break.
UNIT III : SCHEDULING
JOHNSONs PROBLEM
Consider the following flow-shop problem :









t
11
means that job number 1 is loaded on Machine-1







JOB (i ) Machine - 1 Machine - 2
1
2
3
.
.
.
n
t
11

t
21

t
31




t
n1

t
12

t
22

t
32




t
n2

UNIT III : SCHEDULING
JOHNSONs ALGORITHM
Step 1. Find the minimum among t
i1
and t
i2
.
Step 2a. If the minimum processing time requires Machine
1, place the associated job in the first available position in
sequence. Go to Step 3.
Step 2b. If the minimum processing time requires Machine
2, place the associated job in the last available position in
sequence. Go to Step 3.
Step 3. Remove the assigned job from consideration and
return to Step 1 until all positions in sequence are filled.
(Ties may be broken randomly)

UNIT III : SCHEDULING
#5. Consider the following two machines and six jobs flow
shop scheduling problem. Using Johnsons algorithm,
obtain the optimal sequence which will minimize the
makespan.

Job (i) Machine 1 Machine 2
1 5 4
2 2 3
3 13 14
4 10 1
5 8 9
6 12 11
UNIT III : SCHEDULING
***4=[6] means that job 4 is assigned to 6
th
position in the sequence










The optimal sequence is 2 - 5 - 3 - 6 - 1 - 4
NB. t
ik
: i is job number and k is the machine number
Stage Unscheduled
jobs
Minimum
t
ik

Assign-
ment
Partial sequence
1 1, 2, 3, 4, 5, 6 t
42
4[6] X X X X X 4
2 1, 2, 3, 5, 6 t
21
2[1] 2 X X X X 4
3 1, 3, 5, 6 t
12
1[5] 2 X X X 1 4
4 3, 5, 6 t
51
5[2] 2 5 X X 1 4
5 3, 6 t
62
6[4] 2 5 X 6 1 4
6 3 t
31
3[3] 2 5 3 6 1 4
UNIT III : SCHEDULING
The make-span is determined as shown below :
Time-in on Machine 2 = max [Machine 1 time-out of current
job, Machine 2 time-out of previous job
The optimal sequence as found before is : 2 - 5 - 3 - 6 - 1 - 4









The makespan for this schedule is 53.

PROCESSING TIME
JOB MACHINE -1 MACHINE -2 IDLE TIME
ON M/C-2
TIME -IN TIME-OUT TIME-IN TIME-OUT
2 0 2 2 5 2-0=2
5 2 10 10 19 10-5=5
3 10 23 23 37 23-19=4
6 23 35 37 48 37-37=0
1 35 40 48 52 48-48=0
4 40 50 52 53 52-52=0
UNIT III : JOB SHOP SCHEDULING
In job shop problem, we assume that each job has m different
operations. If some of the jobs have less than m operations,
required number of dummy operations with zero processing
times are assumed. By this assumption, the condition of equal
number of operations for all the jobs is ensured.
Unlike the flow shop model, there is no initial machine that
performs only the first operation of a job, nor there is a terminal
machine that performs only the last operation of a job. In job
shop case, different jobs will have different operation
sequences.
Each operation j in the operation sequence of the job i in the
job shop problem will be described with triplet (i,j,k) where k is
the required machine for processing jth operation of the ith job.