Heuristic Algorithms for the 1-m-1 Hybrid Flow Shop Scheduling Problem with Lot Streaming, No-Wait, Blocking, and Sequence-Dependent Setup Times
This study considers a 1-m-1 hybrid flow shop scheduling problem that simultaneously incorporates four practical constraints: lot streaming, no-wait, blocking, and sequence-dependent setup times. Although each of these characteristics has been studied individually in the literature, their joint consideration in a singl...