Solution Procedures for the Lot‐Streaming Problem

Abstract

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.