Flow shop scheduling with lot streaming

Authors:
C. N. Potts;K. R. Baker
Affiliations:
Faculty of Mathematical Studies, University of Southampton, Southampton S09 5NH, UK;The Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH 03755-1798, USA
Venue:
Operations Research Letters
Year:
1989

Citing 0
Cited 5

Evolutionary algorithms for scheduling m-machine flow shop with lot streaming

Robotics and Computer-Integrated Manufacturing
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Expert Systems with Applications: An International Journal
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Information Sciences: an International Journal
Approximation methods for discrete lot streaming in flow shops

Operations Research Letters
Lot streaming in open shops

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lot streaming is the process of splitting a job into sublots so that its operations can be overlapped. This paper deals with the problem of minimizing the length of a flow shop schedule when lot streaming is invoked. We show when it is sufficient in the one-job model to use the same sublot sizes for all machines, and we analyze the use of equal-sized sublots as a heuristic procedure. Finally, we demonstrate some of the difficulties involved in the n-job problem.