Kalir, Adar A.; Sarin, Subhash C. - In: Omega 29 (2001) 6, pp. 577-584
In this paper, we consider the lot-streaming problem of sequencing a set of batches, to be processed in equal sublots, in a flow-shop, so as to minimize makespan. A new heuristic procedure, called the bottleneck minimal idleness heuristic, is developed. Results of an experimental study are...