MECHANICAL ENGINEERING

GATE - 2023 CRASH COURSE

Industrial Engg. &
O pe ra ti on Re s ea r ch

Scheduling
&
Sequencing

LECTURE 14 AMIT DIXIT

C
Djj
Concept:

C
Djj
 Scheduling & Sequencing
It is the process of arranging, controlling and optimizing
work and workloads in a production process.

C
Djj
One Machine & n Jobs Problem Methods:
1. Shortest Processing Time (SPT)

2. Earliest Due Date (EDD)

C
Djj

3. Minimum Slack Time Remaining (STR)

1. Service workshop has four jobs on hand to be
processed. The Due date and Processing time is given
in table below:
Job Process time (days) Due Date
A 3 7
B 6
C
Djj
9
C 5 4
D 9 14

Consider mean lateness and mean flow time, Recommend

the desirable rule : SPT / Minimum Slack Time
SPT Method:
Job P.T. D.D. Time Time Tardiness
in Out

C
Djj
Important Parameters for decision making:

C
Djj
EDD Method:
Job P.T. D.D. Time Time Tardiness
in Out

C
Djj
Minimum Slack Time Remaining Method:
Job P.T. D.D. Time Time Tardiness
in Out

C
Djj
2. A job shop incurs a cost of Rs. 60 per day for
each day a job is in the shop. At the beginning of
month there are 5 jobs in shop to process:
Job A B C D E
P. T. (days) 5 3 8 2 6
D.D. (days) 10 C
Djj 12 20 9 8
• Which schedule will minimize the total cost
• What is the minimum total cost
• Which jobs fail to meet their due date
SPT Method:
Job P.T. D.D. Time Time Tardiness
in Out
D 2 9
B 3 12
A 5 10
C
Djj

E 6 8
C 8 20
Two Machines & n Jobs Problem Methods:
Johnson’s Rule:

C
Djj
3. Find Make span time to complete the all jobs.
Also find idle time of Machine 2:
Job J1 J2 J3 J4 J5 J6
Machine 1 4 6 7 8 9 1
Machine 2 5 8 1 3 6 10
C
Djj
Job Machine 1 Machine 2
PT Tin Tout PT Tin Tout

C
Djj