Article ID: | iaor20163635 |
Volume: | 66 |
Issue: | 2 |
Start Page Number: | 263 |
End Page Number: | 290 |
Publication Date: | Oct 2016 |
Journal: | Journal of Global Optimization |
Authors: | Cheng Ming, Sarin Subhash, Singh Sanchit |
Keywords: | combinatorial optimization, heuristics, computers |
In this paper, we address a single‐lot, lot streaming problem for a two‐stage hybrid flow shop, which consists of one machine at Stage 1 and two parallel (identical) machines at Stage 2. The objective is to minimize makespan. The lot is to be split into sublots each of which is processed first on the machine at Stage 1, and then, on one of the machines at Stage 2. A sublot‐attached removal time is incurred after processing each sublot at Stage 1. First, we assume the number of sublots for the lot to be known a priori and develop closed‐form expressions to obtain optimal, continuous sublot sizes for this case. Then, we consider determination of an optimal number of sublots in addition to their sizes. We develop an upper bound on the number of sublots,