Download presentation
Presentation is loading. Please wait.
Published byKristin Riley Modified over 9 years ago
1
Exercise Find a schedule that minimises makespan.
2
S 1,12,14,13,1 T 1,22,23,24,2 3,31,34,32,3 984 4 563 6 1049 2 Iteration 1: C max =25 Answer
3
Machine 1 1,2,3 L max (1)=4 Machine 2 2,1,3 L max (2)=5
4
Machine 3 3,1,2 L max (3)=0 Machine 4 2,1,3 L max (4)=3
5
Machine 2 is bottleneck. S 1,12,14,13,1 T 1,22,23,24,2 3,31,34,32,3 984 4 563 6 1049 2 Iteration 2: C max =30
6
Machine 1 3,2,1 L max (3)=0 Machine 3 2,1,3 L max (1)=3
7
2,1,3 L max (4)=0 Machine 4
8
Machine 1 is bottleneck. S 1,12,14,13,1 T 1,22,23,24,2 3,31,34,32,3 984 4 563 6 1049 2 C max =33 Can we decrease C max ({1,2}) ? Resequencing machine 2 gives no improvement ! (Check this !)
9
Iteration 3: C max =33 Machine 1 2,1,3 L max (4)=0 Machine 4 3,2,1 L max (4)=0
10
No machine is a bottleneck! S 1,12,14,13,1 T 1,22,2 3,2 4,2 3,31,34,32,3 984 4 563 6 1049 2 Final schedule:
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.