Scheduling/Sequencing

1
 Shop or Manufacturing Schedule
⚫After aggregate planning, shops schedules
are prepared.
⚫It assigns a definite period of time to a
particular shop for manufacturing
products in required quantity.
⚫It shows how much products are to be
prepared and on what day or week etc.

2
 Sequencing n Jobs on 1 Machine
⚫A lot of practical cases require the
sequencing of n jobs on 1 machine
⚫A number of patients to be treated by a
doctor, or a number of broken down
machines to be repaired by a service
mechanic etc.

3
 Assessing Criteria
⚫Job mean flow time:
⚫Time a job is completed minus the time the job was first
available for processing; avg. flow time measures
responsiveness
⚫Average # jobs in system:
⚫Measures amount of work-in-progress; avg. # measures
responsiveness and work-in-process inventory
⚫Makespan:
⚫The time it takes to finish a batch of jobs; measure of
efficiency
⚫Job lateness:
⚫Whether the job is completed ahead of, on, or behind
schedule;
⚫Job tardiness:
⚫How long after the due date a job was completed,
measures due date performance

4
 Commonly Used Priorities Rules
⚫First come, first served (FCFS)
⚫Last come, first served (LCFS)
⚫Earliest due date (EDD)
⚫Shortest processing time (SPT)
⚫Longest processing time (LPT)
⚫Critical ratio (CR):
⚫(Time until due date)/(processing time)
⚫Slack per remaining Operations (S/RO)
⚫Slack /(number of remaining operations)

5
 Shortest Processing
Time (SPT) Rule

6
 Shortest Processing Time (SPT) Rule
⚫Here the job with the least processing time
is picked up first, followed by the one with
the next smallest time and so on till all the
jobs have been picked up.
⚫It achieves the following objectives
⚫Minimizing mean flow time
⚫Minimizing mean in process inventory
⚫Minimizing mean waiting time
⚫Minimizing mean lateness

7
 Example -1
⚫Consider the 8 jobs with processing times,
due dates and importance weights as
shown below

Job (i) 1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1

8
 SPT Rule
⚫Arranging jobs with their processing time in
the
Job (i)ascending order
1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1

⚫4,8,1,3,7,2,5,6 is the complete sequence with

the completion of these jobs at
3,6,11,17,24,32,42 and 56 respectively.
⚫(Job 4 in processing time 3
⚫Job 8 in processing time 3+3=6
⚫Job 1 in processing time 6+5=11
⚫So on…….
9
 SPT Rule
Job (i) 1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1

⚫4,8,1,3,7,2,5,6 is the complete sequence with the

completion of these jobs at 3,6,11,17,24,32,42 and 56
respectively.
⚫Mean flow time = sum of flow time of the jobs / no. of total jobs
(3+6+11+17+24+32+42+56)/8 = 23.9 units
⚫Weighted mean flow time = weighted flow time/sum of total
weightage = (3*1+6*1+11*1+17*3+24*2+32*2+42*2+56*3)/15 = 29
⚫Average in process inventory = sum of flow time/ total processing
time of jobs = (3+6+11+17+24+32+42+56)/ (5+8+6+3+10+14+7+3)=3.41jobs
⚫Mean waiting time under SPT rule = (3+6+11+17+24+32+42)/8 = 16.875
units
10
 Weighted Shortest Processing Time
⚫If the importance weights are to be considered WSPT
rule could be used to minimize the weighted mean
flow time to yield an alternative sequence
⚫The rule states that to start with the job having least
value given by Processing time (ti) / Importance
weight (wi)
i.e. For
⚫Job 1 it is 5/1 = 5
⚫Job 2 it is 8/2 =8
⚫Job 3 it is 6/3 =2 Job (i) 1 2 3 4 5 6 7 8
⚫Job 4 it is 3/1 =3 Processing time 5 8 6 3 10 14 7 3
⚫Job 5 it is 10/2 =5 (ti)
⚫Job 6 it is 14/3 =4.6
Due Date (di) 15 10 15 25 20 40 45 50
⚫Job 7 it is 7/2 =3.5
⚫Job 8 it is 3/1 = 3 Importance 1 2 3 1 2 3 2 1
⚫ so on…. weight (wi)

⚫The sequence is now 3-4-8-7-2-6-1-5

11
 Weighted Shortest Processing Time
Job -
⚫(i) 1 2 3 4 5 6 7 8
⚫-
Processing time (ti) 5 8 6 3 10 14 7 3
⚫-
- (d )
⚫Date
Due i 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1

⚫The sequence is now 3-4-8-7-2-6-1-5 and completion of

these jobs at 6,9,12,19,27,41,46, and 56 respectively

⚫Mean flow time = (6+9+12+19+27+41+46+56)/8 = 27 units

⚫Weighted mean flow time = weighted flow time/sum of

total weightage =
(6*3+9*1+12*1+19*2+27*2+41*3+46*1+56*2)/15 = 27.5

12
 Weighted Shortest Processing Time
⚫The sequence is now 3-4-8-7-2-6-1-5 and completion of these jobs at
6,9,12,19,27,41,46, and 56 respectively
Job (i) 1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1
⚫Tardiness is lateness of time surpassing due date
⚫Mean tardiness = 85/8=10.6 Job seq Flow Due date Tardiness
time
⚫No of tardy jobs = 4
3 6 15 0
4 9 25 0
8 12 50 0
7 19 45 0
2 27 10 17
6 41 40 1
1 46 15 31
13 5 56 20 36
 Earliest Due Date Rule
(EDD)

14
 Job (i) 1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1

Job seq Flow Due date Tardiness

time
2 8 10 0
1 13 15 0
3 19 15 4
5 29 20 9
4 32 25 7
6 46 40 6
7 53 45 8
8 56 50 6
Total 256 40

15
 Earliest Due dates (EDD) Rule
⚫Here the jobs are sequenced in the order
of decreasing due dates of jobs.
⚫The corresponding sequence is
2,1,3,5,4,6,7,8
⚫Mean flow time = 32
⚫Weighted mean flow time = 31.7
⚫Mean tardiness = 5
⚫No of tardy jobs = 6
Job (i) 1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
16 Importance weight (wi) 1 2 3 1 2 3 2 1
 Hodgson’s Algorithm
1. Order all tasks by the EDD rule, if zero or one
task is tardy then stop otherwise go to step 2
2. Starting at the beginning of the EDD sequence
and working towards the end, identify the first
tardy task. If no further tasks are tardy, go to step
4 otherwise go to step 3
3. Examine the sequence till that tardy task and
identify the one with the longest processing time.
Remove the task and set it aside. Revise the
completion time of other task and return to step
2.
4. Place all those tasks that were set aside in any
order at the end of the sequence.

17
 Job (i) 1 2 3 4 5 6 7 8
Processing time (ti) 5 8 6 3 10 14 7 3
Due Date (di) 15 10 15 25 20 40 45 50
Importance weight (wi) 1 2 3 1 2 3 2 1

Job seq Flow Due date Tardiness

time
2 8 10 0
1 13 15 0
3 19 15 4
5 29 20 9
4 32 25 7
6 46 40 6
7 53 45 8
8 56 50 6
Total 256 40

18
 Hodgson’s Algorithm
⚫The sequence as per EDD is 2,1,3,5,4,6,7,8
⚫The first tardy job is job 3 at location 3
⚫Looking at the first three tasks we remove
the one with the longest processing time
(task 2)
Job seq Flow Due Tardiness
⚫Now the new sequence time date

is 1,3,5,4,6,7,8
1 5 15 0
3 11 15 0
5 21 20 1
4 24 25 0
6 38 40 0
7 45 45 0
8 48 50 0

19
 ⚫Again the first tardy job, job 5, is at
location 3
⚫Removing it the sequence becomes
1,3,4,6,7,8 with no tardy jobs
⚫The final sequence will be 1,3,4,6,7,8,2,5 or
1,3,4,6,7,8,5,2
⚫ No of tardy jobs = 2

20
 Gantt chart
Simple graphical display technique – suitable for
less complex situations
• This does not provide any rules for choosing but
simply presents a graphical technique for
displaying results (and schedule) and for
evaluating results (makespan, idle time, waiting
time, machine utilization, etc.)

21
 Example of Gantt Chart

22
 Example of Gantt Chart

23
 Example of Gantt Chart

24
 END

25