Solution Procedures for the Lot‐Streaming Problem
研究了批量流中如何将工件拆分为子批以加速生产，提出了针对两台机器两个子批问题的高效求解方法，并探讨了瓶颈分析和多子批的启发式算法。
ABSTRACT Lot streaming is the process of splitting a job into sublots so its operations can be overlapped and its progress accelerated. We present a computationally efficient procedure for solving the m ‐machine, two‐sublot problem, and we discuss the bottleneck insights that emerge from the analysis. We also examine heuristic approaches for more than two sublots and discuss computational results for these procedures.