The evolution of schematic representations of flow shop scheduling problems (Q2304109): Difference between revisions

Different network-based schematic representations for flow shop scheduling problems are reviewed. In particular, flow shop variants with blocking, synchronous transfers, no-wait, no-idle time and limited buffer space are covered. Based on these schematic diagrams, some flow shop anomalies are explained. Finally, schematics using a string analog concept are introduced.