Bhagt &auran g ale

chi
ME 461AME371
I.Siage Maohine Shed hinp,n b4
N.Sinha (UTK)

of pProductionActiio
Scheduling and Controling of
Let all things be done decently and in order." -I Corrinthians
The following three basic data are necessary to describe jobs in a deterministic single machine
scheduling problem.
Processing time (t ): It is the time required to process job j. The processing time, tË will
normally include both actual processing time and set-up timne.
Ready time (r): It is the time at which job jis available for processing. The ready time of a job
is the difference between the arrival time of that job and the time at which that job is take A
processing. In the basicmodel, as per condition I, r; = 0for alljobs. p o m p l e t o n
cnhial
Due date (d): It is the time at which the job j is to be completed.
Completion time (C): It is the time at which the job j is completed in a sequence. Performance
measures for evaluating schedules are usually function of job con1pletion time. Some, sample
performance measures are Flow time, Lateness, Tardiness, etc.
Flow time (F): 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 asystem. This in tun gives some idea about in
the
process inventory due to a schedule. It is the difference between the completion time and
ready time ofthe job j. i.e. F; =CG-Ij.=0} t t)
Lateness (L): Itis the amount of time by which the completion time of job j differs from the
due date (Lj=G-d). Lateness is a measure which gives an idea about conformity of the jobs in
a schedule to a given set of due dates of the jobs. Lateness can be either positive lateness or
negative lateness.

Tardiness (T): Tardiness is the lateness of jobjifit fails to meet its due date, or zero, otherwise
T;= max {0; C;- d) =max {0; L }.
Measures of performance
The different measures of performance which are used in
listed below with their formulas. the single machine scheduling are

Mean flow time: F = 1F

Mean tardiness:: T ='y

Maximum flow time: Max {F;}; 1<jsn

Maximum tardiness: Max (T;}; 1<jsn

1
ME 461A/ME371
N. Sinha (IITK)

Number of tardyjobs: N,= j=l

where
S(T) = , if T,> 0, andf(T) =0, otherwise.
Classical Scheduling Problems FCFS ’Sirt com
A. Shortest processing time (SPT) rule
increasing order of
In single machine scheduling problem, sequencing the jobs in
processing time is known as the shortest processing time (SPT) sequencing.
Shortest processing time (SPT) rule minimizes the mean flow time.

Ilustrative Example
Consider the following single machine-scheduling problem.
1 2 3 4 5
Job ()
15 4 5 14
Processing time (t) (hrs)
Assume H=O. 2 1
Find the optimal sequençe, which will minimize the mean flow time and also obtain the
minimum mean flow time.

Itj F=L4+47+3l
S
tu)
H4| 31
L21.4 hs
wa ghted Shottest Pooes in q i (w) eue
SJab2. 3
5

B. Earliest due date (EDD) rule

62 42
The lateness (L) of a job is defined as the difference between the
due date of that job. L;can be either positive or negative values. completion time and the
F i8- 8hy
The maximum job lateness (Lmax) and Lj=CGj-d
the
by Earliest Due Date sequencing. In a singlemaximum job tardiness (Tmax) are minimized
machining scheduling
of jobs in increasing order of due date is
known as 'Earliest Due Dateproblem,
Rule'.
sequencing

Illustrative Example 2
Consider the following single
machine-scheduling problem:
2
ME 461A/ME371
N. Sinha (ITK)

Job () 3 4 5 6
Processing time (t) (hrs) 10 7 12 15
Due date (d,) 15 10 12 11 18 25

Determine the sequence which will minimize the maximum lateness (Lmax). Also,
determine Lmax With respect to the optimal sequence.
2 3 5 6 -Optmal Sequene;
to 12. 15
I5 23
33 45
-2 4 18. 2 sptima Lmax

Minimizing the number of tardy jobs

If ajob is completed beyond its due date, then it is called tardy job; otherwise it is called non-tardy job. In
many organizations, the objective may be to minimize the total number of tardy jobs.
If the EDD sequence yields zero tardy, or it yields exactly one tardy job, then it is an optimal sequence for
minimizing the total number of tardy jobs (NT), If ityields more than one tardy job, the EDD sequence
may not yield the optimal solution. An exact algorithm for the general case is given below. The final
sequence consists of two streams of jobs as given below:
(a) First, a set (E) of early jobs, in EDD order.
(b)Then, a set (L) of late jobs, in any order.
This algorithm gives optimal sequence, which will result in minimum number of tardy jobs
(NT).
HODGSON'S Algorithm to minimize NT
Step 1: Arrange the jobs in EDD order and assumethis, as set E.
Let set L be empty.
Step 2: If no jobs in E are late, then
be in EDD order. But the jobs in L stop. Find the union of E and L (Note: The remaining jobs in E
can be in any order); otherwise, should
job K. identify the first late job in E.Let it be
Step 3: Identify the
it in L. Revise the longest job, among the first Kjobs in the
completion times of the jobs remaining in Esequence. Remove this
and return, to Step 2.: job from E and place

3
 N. Sinha (IITK)
ME 461A/ME371
seven
systems consulting company is under contract to carry out
usTrative Example: A computer small group and they work
deadliness assured in days from now. The consultants are a Under the terms of
projects, all with and completed sequentially.
project will be started
tOgether on each project, so that the 24,000 for each project completed on time, but they will incur
Rs.
Contract, the consultants will receive completed late. Each project has an, associated duration, which is
project
Rs,40,000 in penalties for cach
carry out the project as shown below.
the anticipated number of days required to
order to maximize net revenues?
How should the projects be sequenced in
5 6
1 2
Project ID 8 10 12 14
2 4 6
Duration (D) 19 12 18 24
6 12 30
Deadlines (d)

blow
Solution: Step 1: The earliest due date order is shown
1 25 6 +) 3
Oeadline 6. i2 12
Place the above sequence of projects which is in EDD order in set E. Therefore,

Set E= )2., 5, 6, 4, +
Set L= (Empty).
Step 2: The lateness of the projects are checked as shown below:

Project 1 2 5 6 4 3
Duration 4 10 12 8 14 6
Completion time 2 6 16 28 36 S6
Due date 12 24
Tardy/non-tardy (1/0) 0

In the above table, in the last row, 0 means that the project is
non-tardy and 1 means that the project is
tardy.
As per the sequence in the set E, there are five tardy
third position.
projects. The first tardy project is 5, which is in the

Step 3:The project with the largest duration

among the first-three projects in the sequence is 5.
Remove this project and append it to L. Therefore
L= {5)
E={1,2, 6, 4,7, 3}.
The completion times of the
projects in the set E are revised as shown
below:
Project 1 2 6 4
3
ME 461A/ME371
N. Sinha (ITK)
Duration 4 12
Completion time 2 14 6
Due date 46

Tardy/non-tardy 24
1

Step 2: From Step 3, it is clear that there are

three tardy projects. The first tardy project is 4, which is in
the fourth position of the sequence in the set E.
Step 3: The project with the longest duration among the
from the set Eand append it to the set L. Therefore first-four projects is 6. Remove the project-6

E= {1, 2, 4, 7, 3}

L={5,6}.
The completion times of the projects in the set Eare revised as shown:
Project 1 4 7 3
Duration 4 8 14 6
Completion time 2 28 34
Due date
Tardy/non-tardy 1

Step 2: From the table shown in Step 3 it is known that there are two tardy projects. The first tardy project
is 7, which is at the fourth position in the set E.
Step 3: The project with the longest duration. Among the first-four projects in the set E are 7.

Remove this job from the set E and append it to the set L.

E={1, 2, 4, 3}
L= {5, 6, 7}.

The completion times of the projects are revised as shown below:

2 4 3
Project
Duration
Completion time
Due date
Tardy/non-tardy

Bot Seyuei
L,2,93 5,6)+
5

fzyeet 30
Conyletien
Oue ate
ME 461A/ME371
N. Sinha (I1TK)
Johnson's Problem
For aproblem with 2
machines and njobs, Johnson had developed
solution, i.e., in a definite a polynomial algorithm to get optimal
problem: time, one can get the optimal solution. Consider the following flow shop
Job Machine 1 Machine 2
t1 t12
2 t21 t2
3 ts1 t32
ti tn2

In the above table, ti represents the processing time of the job i on the
machinej. X
Johnson's Algorithm t m i n let 3 2.
Step 1: Find the minimum among various t1 and t2.
Step 2a: If the minimum processing time requires machine 1, place the associated job in the first
position in sequence. Go to Step 3. available
Step 2b: If the minimum processing time requires machine 2, place the
position in sequence. Go to Step 3. associated job in the last available
Step 3: Remove the assigned job from consideration and return to Step 1
are filled. (Ties may be broken randomly.) until all positions in sequence

Illustrative example 2: Consider the following two machines and six jobs
problem. Using Johnson's algorithm, obtain the optimal sequence, which will flow shop-scheduling
minimize the makespan.
Job Machine 1
1 Machine 2
4
2 2
.3 3
13 14
4
10
8
9
12
11

Solution:

Stage Unscheduled jobs

1 Minimum tik
1,2, 3, 4, 5, 6
1, 2, 3, 5, 6
t42 Assignment
4 =[6] Partial sequence
t21
3
S,6 23C11 XXXXX4
6 t12 1=[1 2xxXX4
6
ts 521
The ontimal
sequence is
table:
256nemakespan 1s
determined as shown below. In the
following
ME 461/ME371 N. Sinha (ITK)
Job |Machine 1L Macbihetime2 out
in
time iaEmeotti me
2

2.3 23
23 39
1 30
-Extension of Johnson's ule O
Considera 'three machines and n jobs' flow shop scheduling problem as shown in table below.

Processing time
Job Machine 1 Machine 2 Machine 3
tË1 t12 t13
tz1 t22 t23
t1 t3 t33
4 t4 t4z t43
ts ts2 ts3

ti ti3

N
tn2 tn3

One can extend Johnson's algorithm to the problem

conditions is satisfied. Ik shown in Table 1 if anyone of the following two
min

te:> max
If anyone of the above conditions is satisfied then. we can extend the
following way. Johnson's algorithm in the
Create a hypothetical problem with two
to obtain optimal sequence for the machines and n iobs as shown in the table below. The
the optimal sequence by using the data given in the Table 2. Later. the objective 1s
data of the original problem makespan is to be determined 1o
shown in table.
Job M/c C-A MIc C-B
2

7
 ME 461AME371
N.Sinha (ITK)

lustrative Example: Consider the following 3 machines and 5

jobs flow shop probe

Job Processing time

Machine 1 Machine 2 Machine 3
8
2
6
3 6 2
4 7 3
5 11 4 5

Solution: mio tj G=max tej, min Condtn nt satisfied

Job Machine A Machine B
14 8
-2
3
4
'5
Find the optimal sequence.
Stage Unscheduled jobs Minimum tk Assignment Partial sequence
1 4,2,3,4,5 t31 3= C]
2
3
4
5 t ?42
Find the makespan.

Jol machie nahone

6 13

2 I3 23. 22 2q 3
34 3P 38
42

anesp an