Lot Streaming Techniques
Abstract
In batch manufacturing, the items are grouped into batches. These batches are treated as individual jobs and they are not splitted. However, if batch sizes are large, it may be beneficial to split these batchesinto smaller transfer lots which is known as lot streaming. Lot streaming provides acceleration of the production by processing the items of the original batch in an overlapping fashion. In this paper, the lot streaming problem is defined, the problem characteristics and the notation are explained. Then the solution procedures in the literature for lot streaming problems are discussed respectively for 2-machine, 3-machine and, m-machine cases. For alltypes of 2 and 3-machine problems, there exist polynomial time algorithms. For certain m-machine problems, there also exist polynomial time algorithms.
Keywords
References
- [1] C.A. Glass, J.N.D. Gupta and C.N. Potts, Lot streaming in three-stage production processes, European Journal of Operations Research, 75:378-394, 1994.
- [2] C. N. Potts and K. R. Baker, Flow shop scheduling with lot streaming, Operations Research Letters, 8:297-303, 1989.
- [3] D. Trietsch and K. R. Baker, Basic technique for lot streaming, Operations Research, 41:1065-1076, 1993.
- [4] Goldratt E. and Fox R. E., (1986) The Race. North River Press, Crotonon-Hudson, NY.
- [5] K. R. Baker, Lot streaming to reduce cycle time in a flow shop, Working Paper, The Amos Tuck School of Business Administration, DartmouthCollege, Hanover, N.H.
- [6] K. R. Baker and D. Jia, A comparative study of lot streaming procedures, OMEGA Int. J. of Management Science, 5:561-566, 1993.
- [7] K. R. Baker, Lot streaming in the two-machine flow shop with setup times, Annals of Operations Research, 57:1-11, 1995.
- [8] Omer S. Benli, Lot streaming in production scheduling, Department of Industrial Engineering, Bilkent University, Ankara - Turkey.
Details
Primary Language
English
Subjects
-
Journal Section
Research Article
Authors
Ahmet Reha Botsalı
*
Türkiye
Publication Date
December 28, 2019
Submission Date
October 8, 2019
Acceptance Date
December 27, 2019
Published in Issue
Year 2019 Volume: 3 Number: 4