Procedure
- Make Graph
- Determine starting makespan
- Determine optimal sequence for bottleneck machine (Considering precedence constraints)
- Perform an iteration
- Lowest maximum lateness
- Branch and bound technique
- Include optimal sequence in graph
- Perform an iteration
- Determine optimal sequences for remaining machines (Considering precedence and machine constraints)
- Perform further iterations
- Conduct iterations until all machines have been accounted for
- Draw out final graph
- Determine final makespan
- Perform further iterations
Read more about this topic: Shifting Bottleneck Heuristic