JOBS PROCESSING TIME Find the optimal sequence using SPT.

(sequence the jobs from shortes

1 15 No of jobs =5
2 4
3 5 Jobs 2 3
4 14 Processing Time 4 5
5 8 Flow time 4 9

Compute for Fmin

) 1/5(107)
21.4 HRS

therefore the optimal mean flow time

uence the jobs from shortest to longest Pj)

shortest processing time (SPT) A

5 4 1 priority sequencing rule that
8 14 15 specifies that the job requiring the
shortest processing time is the next
17 31 46 job to be processed.Shortest
processing time rule would require the
job with the shortest processing time to
be processed ahead of all other
waiting jobs. The use of this rule for
sequencing will minimize the average
time a job spends at the workcenter
(waiting time plus processing time),
which is called average time in the
system.
Consider the following single machine-scheduling problem with weights
JOBS 1 2 3 4 5
PROCESSING TIME 15 4 5 14 8
WEIGHT 1 2 1 2 3
Tj / Wt 15 2 5 7 2.67

Determine the sequence, which will minimize the weighted mean flow time of the above problem. Also find the weighted mea
Arrange the job in increasing order to get the optimal sequence in the order of tj/wj

JOBS 2 5 3 4 1 Therefore optimal sequence, 2-5-3-4-1

PROCESSING TIME 4 8 5 14 15
Cj Fj 4 12 17 31 46
WEIGHT 2 3 1 2 1
Fj * WT 8 36 17 62 46

Compute for the weighted mean flow time using the formula below.

169/9 18.78 hrs.

m. Also find the weighted mean flow time

optimal sequence, 2-5-3-4-1 which will minimize the weighted mean flow time, is,
Consider the following single machining scheduling problem

JOBS 1 2 3 4 5 6
PROCESSING TIME 10 8 8 7 12 15
Ddate 15 10 12 11 18 25

Determine the sequence which will minimize the maximum lateness (Lmax). Also, determine Lmax with respect to the optima

SOLUTION: Arrange the jobs as per EDD rule (i.e. in the order of their due dates).

Jobs 2 4 3 1 5 6
Processing time 8 7 8 10 12 15
Ddate 10 11 12 15 18 25
Completion time 8 15 23 33 45 60
Lateness (Cj-Dj) -2 4 11 18 27 35

The EDD sequence is 2-4-3-1-5-6

This sequence gives a minimum value for Lmax 35
From the table, the maximum is 35 . This is the optimal value for Lmax. The Lmax of any other nonEDD sequence will not be l
max with respect to the optimal sequence

r nonEDD sequence will not be less than 35 .

Consider the following two machines and six jobs flow shop-scheduling problem. Using Johnson’s algorithm, obtain the optima

The makespan is determined as

JOBS MACHINE 1 MACHINE 2 The optimal sequence is Jobs

1 5 4 2
2 5 3 6 1 4
2 2 3 5

3 13 14 3

4 10 1 6

5 8 9 1

6 12 11 4

[Time-in on M/c 2 = max [M!c 1

The makespan for this schedule

Johnsons Algorithm for N jobs 2 Machines

The Johnsons iterative procedure for determining the optimal
sequence for an n-jobs 2 machine sequencing problem can be
outlined as follows:

Step 1. Find the shortest processing time among the jobs not yet
scheduled. If two or more jobs are tied, choose one job arbitrarily

Step 2. If the shortest processing time is on machine 1, schedule

the corresponding job as early as possible. If the shortest
processing time is on Machine 2, schedule the corresponding job as
late as possible

Step 3. Eliminate the last job scheduled for further consideration.

Repeat steps 1 and 2 untill all jobs have been scheduled
on’s algorithm, obtain the optimal sequence, which will minimize the makespan

The makespan is determined as shown below

Machine 1 Time In Time out Machine 2 Time In Time out Idle Time

2 0 2 3 2 5 2

8 2 10 9 10 19 5

13 10 23 14 23 37 4

12 23 35 11 37 48 0

5 35 40 4 48 52 0

10 40 50 1 52 53 0

[Time-in on M/c 2 = max [M!c 1 Time-out of the current job, M/c 2 Time-out of the previous job]

The makespan for this schedule is 53

Find the makespan using the CDS heuristic for the following flow shop problem

Jobs tj1 tj2 tj3 tj4 Solution Jobs tj1

1 4 3 7 8 1 4
2 3 7 2 5 2 3
3 1 2 4 7 3 1
4 3 4 3 2 4 3

The optimal sequence for the above problem is 3-2-1-4

makespan calculation

Jobs Machine 1 Time In Time out Machine 2 Time In Time out Machine 3 Time In
3 1 0 1 2 1 3 4 3
2 3 1 4 7 4 11 2 11
1 4 4 8 3 11 14 7 14
4 3 8 11 4 14 18 3 21

Makespan of this problem is 31

Jobs tj1 tj2 tj3 tj4 Jobs tj1 tj2

1 4 3 7 8 1 7 15
2 3 7 2 5 2 10 7
3 1 2 4 7 3 3 11
4 3 4 3 2 4 7 5

Jobs Machine 1 Time In Time out Machine 2 Time In Time out Machine 3 Time In

3 1 0 1 2 1 3 4 3
1 4 1 5 3 5 8 7 8
2 3 5 8 7 8 15 2 15
4 3 8 11 4 15 19 3 19

Makespan of this problem is 30

Jobs tj1 tj2 tj3 tj4 Jobs tj1 tj2

1 4 3 7 8 1 14 18
2 3 7 2 5 2 12 14
3 1 2 4 7 3 7 13
4 3 4 3 2 4 10 9

Jobs Machine 1 Time In Time out Machine 2 Time In Time out Machine 3 Time In

3 1 0 1 2 1 3 4 3
2 3 1 4 7 4 11 2 11
1 4 4 8 3 11 14 7 14
4 3 8 11 4 14 18 3 21

Makespan of this problem is 31

 tj2
8
5
7 The CDS algorithm uses Johnson's Rule in a heuris
2 schedules from which a "best" schedule is chosen
multistage use of Johnson's Rule applied to a two-mac
the above problem is 3-2-1-4 the original.

Time out Machine 4 Time In Time out

7 7 7 14
13 5 14 19
21 8 21 29
24 2 29 31

Sequence 3 1 2 4

Time out Machine 4 Time In Time out

7 7 8 15
15 8 15 23
17 5 23 28
22 2 28 30

SUMMARY

STAGE SEQUENCE
Sequence 3-2-1-4 Stage 1 3-2-1-4
Stage 2 3-1-2-4
Stage 3 3-2-1-4

The best sequence is 3-1-2-4, which has the

Time out Machine 4 Time In Time out

7 7 7 14
13 5 14 19
21 8 21 29
24 2 29 31
ohnson's Rule in a heuristic fashion and creates several
best" schedule is chosen. The algorithm corresponds to a
Rule applied to a two-machine pseudo-problem derived from
the original.

Makespan
31
30
31

uence is 3-1-2-4, which has the makespan of 30.