IPE 493
Industrial Management
Topic: Scheduling
R. M. SHAHBAB
Lecturer, Department of IPE, BUET
Email: [email protected]
1
Objectives of Work-Center Scheduling
Meeting due dates
Minimizing lead time
Minimizing setup time or cost
Minimizing work-in-process inventory
Maximizing machine utilization
References
Chapter 16: Scheduling Chapter 17: Operations Scheduling
By William J. Stevenson By Chase & Jacobs
Operations Management, 11th Edition Operations Management, 11th Edition
McGraw-Hill Irwin McGraw-Hill Irwin 2
Scheduling: Sequencing of activities related
to time so that it can give economic result.
Scheduling = Sequencing + Timing
What is
Scheduling
Sequencing: Specifies the order in which job
?
should be performed.
Timing: Timeline for a sequence of jobs or
operations.
3
Scheduling Priority Rules for Dispatching Jobs
Specifies the order in which jobs should be performed at
work centers
Priority rules are used to dispatch or sequence jobs
FCFS: First come, first served
SPT: Shortest processing time
EDD: Earliest due date
LPT: Longest processing time
4
Scheduling Priority Rules for Dispatching Jobs
Priority Rules Description
First Come, First Served
FCFS The first job to arrive at a work center is processed first
Shortest Processing Time
SPT The job with the shortest processing time is processed first
Earliest Due Date
EDD
The job with the earliest due date is processed first
Longest Processing Time
LPT The job with the longest processing time is processed first
5
Scheduling Sequencing Examples
Apply the four popular sequencing rules to these five jobs
Job Job Processing Time Job Due Date
(Days) (Days)
A 6 8
B 2 6
C 8 18
D 3 15
E 9 23
FCFS sequence: ?
6
Scheduling Sequencing Examples
Apply First Come, First Served (FCFS) sequencing rule to these five jobs:
FCFS: Sequence A-B-C-D-E
Job Job Processing Flow Job Due Job
Sequence Time Time Date Lateness
A 6 6 8 0
B 2 8 6 2
C 8 16 18 0
D 3 19 15 4
E 9 28 23 5
28 77 11
7
Scheduling Sequencing Examples
FCFS: Sequence A-B-C-D-E
Sum of total flow time
Average flow time = = 77/5 = 15.4 days
Number of jobs
Total late days
Average job lateness = Number of jobs = 11/5 = 2.2 days
8
Scheduling Sequencing Examples
Apply the four popular sequencing rules to these five jobs
Job Job Processing Time Job Due Date
(Days) (Days)
A 6 8
B 2 6
C 8 18
D 3 15
E 9 23
SPT sequence ?
9
Scheduling Sequencing Examples
Apply Shortest Processing Time (SPT) sequencing rule to these five jobs:
SPT: Sequence B-D-A-C-E
Job Job Processing Flow Job Due Job
Sequence Time Time Date Lateness
B 2 2 6 0
D 3 5 15 0
A 6 11 8 3
C 8 19 18 1
E 9 28 23 5
28 65 9
10
Scheduling Sequencing Examples
SPT: Sequence B-D-A-C-E
Sum of total flow time
Average flow time = = 65/5 = 13 days
Number of jobs
Total late days
Average job lateness = Number of jobs = 9/5 = 1.8 days
11
Scheduling Sequencing Examples
Apply the four popular sequencing rules to these five jobs
Job Job Processing Time Job Due Date
(Days) (Days)
A 6 8
B 2 6
C 8 18
D 3 15
E 9 23
EDD sequence ?
12
Scheduling Sequencing Examples
Apply Earliest Due Date (EDD) sequencing rule to these five jobs:
EDD: Sequence B-A-D-C-E
Job Job Processing Flow Job Due Job
Sequence Time Time Date Lateness
B 2 2 6 0
A 6 8 8 0
D 3 11 15 0
C 8 19 18 1
E 9 28 23 5
28 68 6
13
Scheduling Sequencing Examples
EDD: Sequence B-A-D-C-E
Sum of total flow time
Average flow time = = 68/5 = 13.6 days
Number of jobs
Total late days
Average job lateness = Number of jobs = 6/5 = 1.2 days
14
Scheduling Sequencing Examples
Apply the four popular sequencing rules to these five jobs
Job Job Processing Time Job Due Date
(Days) (Days)
A 6 8
B 2 6
C 8 18
D 3 15
E 9 23
LPT sequence ?
15
Scheduling Sequencing Examples
Apply Longest Processing Time (LPT) sequencing rule to these five jobs:
LPT: Sequence E-C-A-D-B
Job Job Processing Flow Job Due Job
Sequence Time Time Date Lateness
E 9 9 23 0
C 8 17 18 0
A 6 23 8 15
D 3 26 15 11
B 2 28 6 22
28 48
103
16
Scheduling Sequencing Examples
LPT: Sequence E-C-A-D-B
Sum of total flow time
Average flow time = = 103/5 = 20.6 days
Number of jobs
Total late days
Average job lateness = Number of jobs = 48/5 = 9.6 days
17
Scheduling Summary of the Rules
Rule Average flow time (Days) Average
Lateness (Days)
FCFS 15.4 2.2
SPT 13 1.8
EDD 13.6 1.2
LPT 20.6 9.6
18
Scheduling Comparison of Sequencing Rules
No one sequencing rule excels on all criteria
SPT does well on minimizing flow time and number of jobs in the
system
But SPT moves long jobs to the end which may result in
dissatisfied customers
EDD minimizes lateness
FCFS does not do especially well (or poorly) on any criteria but is
perceived as fair by customers
19
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 2 machines
WS1 WS2
Processing Time (days)
Job Station 1 Station 2
A 5 5
B 4 3
C 8 9
D 2 7
E 6 8
F 12 15
20
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 2 machines
Station 1
D A E C F B
D A E C F B
Station 2
21
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
Processing Time (days)
Job Station 1 Station 2 Station 3
A 7 2 3
B 6 4 2
C 8 5 4
D 9 2 5
E 10 3 7
22
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
WS1 WS2 WS3
Conditions:
Minimum of the jobs’ processing times at station 1 has to be greater than
maximum of the jobs’ processing times at station 2
OR
Minimum of the jobs’ processing times at station 3 has to be greater than
maximum of the jobs’ processing times at station 2
Combine WS1 & WS2 to form WC 1 and combine WS2 & WS3 to form WC 2
23
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
Processing Time (days)
Job Center 1 Center 2
A 9 5
B 10 6
C 13 9
D 11 7
E 13 10
24
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
W
S E C D B A
1
W
S E C D B A
2
W
S E C D B A
3
25
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
Processing Time (days)
Job Station 1 Station 2 Station 3
A 3 2 7
B 2 4 6
C 4 5 8
D 5 2 9
E 7 3 10
26
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
Processing Time (days)
Job Center 1 Center 2
A 5 9
B 6 10
C 9 13
D 7 11
E 10 13
27
Scheduling Johnson’s Rule
Johnson’s Rule: n jobs 3 machines
W
S A B D C E
1
W
S A B D C E
2
W
S A B D C E
3
28
