Premium
Solution Procedures for the Lot‐Streaming Problem
Author(s) -
Baker Kenneth,
Pyke David
Publication year - 1990
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1990.tb00328.x
Subject(s) - bottleneck , computer science , heuristic , process (computing) , mathematical optimization , scheduling (production processes) , operations research , artificial intelligence , mathematics , embedded system , operating system
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.