Professional Documents
Culture Documents
Bsor Project Application of Job Shop Scheduling
Bsor Project Application of Job Shop Scheduling
Application of
Job Shop Scheduling
Job Shop
Scheduling Problem
1. Arrival Pattern
3. Work Sequence
Criterion
• Makespan – total time to completely
process all jobs (Most Common)
• Average Time of jobs in shop
• Lateness
• Average Number of jobs in shop
• Utilization of machines
• Utilization of workers
Gantt Chart
3 2 4 5 1
3 2 4 5 1
5 10 15 20 25 30 35
Example of Gantt Chart
(III)
Processing Time:
Job
P 4
4
1
10 5
2
2
6 6
8
3
5
W P/w
1 4.0
5 2.0
3 0.67
10 0.6
5 1.60
5 1.0
4. Remove assigned job from the list and repeat (break ties
at random)
Scenario 2 – n jobs, 2 machines,
Job 5 Mach 1
1 4
2 1
3 5
4 2
M 3
5
a 2
c
h 4
3
2
6
• Example con’t.
Machine1
2 4 5 3 1
Machine2
2 4 5 3 1
5 10 15 20 25
Makespan = 21
Mach 1 = 0 idle plus 4 end of day
Machine 2 = 2 idle + 1 beginning of day
2 wait units (job 3,1)
Scenario 3, n jobs, 2 machines, any
JOB PA 2 1
1 4 3 9
4 0 PB
Order
5 5
3
6 3
AB
7 4
0
8 2 A
9 0 8
10 4 AB
11 3 8
B
12 9
1
AB
7
AB
6
BA
1
BA
6
B
0
A
4
BA
4
BA
Scenario 3 – Example Con’t.
Machine B: 8,12,7,11,9,4,6,3,1,5
Scenario 3 - Example
6 3 1 5 7 11
2 10 8 12
8 2 7 11 9 4 6 3 1
5
5 10 15 20 48
25 30 35 40 45
2 Jobs, m Machines
Example:
Job 1 Sequence – Machine D, B, A, C
Job 2 Sequence – Machine A, B, C, D
10
5
MachineC
5
10
Time Unit
Machine A Machine B Machine C Machine D
Job 1
MachineA
Job2
MachineB
MachineD
N Jobs, M Machines