Lot streaming and scheduling multiple products in two-machine no-wait flowshops

We consider the problem of minimizing makespan in two-machine no-wait flows hops with multiple products requiring lot streaming. A "product'' (or lot) consists of many identical items. Lot streaming (lot sizing) is the process of creating sublots (or transfer batches) to move the completed portion of a production sublot to downstream machines so that operations can be overl apped. The number of sublots for each product is fixed. When the flowshop p roduces only a single product, we obtain optimal continuous-sized sublots. It is shown that these sublot sizes are also optimal for the problem of sim ultaneous lot streaming and scheduling of multiple products. The optimal sc heduling of products can be accomplished by application of the algorithm du e to Gilmore and Gomory [1]. Then, we devise an efficient heuristic for the problem of simultaneous lot streaming (finding optimal integer-sized sublo ts) and scheduling of multiple products. Computational results indicate tha t this heuristic can consistently deliver close-to-optimal solutions for th e problem. A comparison of this heuristic is also made with a heuristic tha t first divides items belonging to each product into nearly equal-sized sub lots and then constructs a schedule for such sublots. Finally, we extend ou r solution procedures to a traditional and more general lot streaming model , where the number of sublots for each product is a decision variable.