Abstract
We consider the problem of minimizing makespan in a no-wait flow-shop with three machines. Lot streaming (lot sizing) is the process of creating sublots to move the completed portion of a production sublot to downstream machines so that operations will be overlapped. For a given product, we consider the number of sublots as given, and we obtain optimal continuous-sized sublots. Some general results are proved for the general no-wait flow-shop with an arbitrary number of machines. These results are then applied to the 3-machine case, to find the optimal sublots sizes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, K.R. 1990. Solution Procedures for the Lot-Streaming Problem, Decision Sciences,21, 475–491.
Baker, K.R. 1993. Lot Streaming in the Two Machine Flow Shop with Setup Times, Working Paper No. 297The Amos Tuck School of Business Administration, Dartmouth College, Hanover, New Hampshire.
Baker, K.R. 1995. Elements of Sequencing and Scheduling, book published by the Amos Tuck School of Business Administration, Dartmouth College, Hanover, New Hampshire.
Baker, K.R. and D. Jia 1993. A Comparative Study of Lot Streaming Procedure, OMEGA, 21, 561–566.
Glass, CA., J.N.D. Gupta and C.N. Potts. 1994. Lot Streaming in Three-stage Process, European Journal of Operational Research,75, 378–394.
Goyal, S.K. 1976. Note on Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model, Management Science, 23, 332–338.
Goyal, S.K. and C. Sriskandarajah. 1988. No-Wait Shop Scheduling: Computational Complexity and Approximate Algorithms, Opsearch, 25, 220–244.
Hall, N.G. and C. Sriskandarajah. 1996. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process, Operations Research, 44, 510–525.
Hsu, E. and M. Stein. 1991. Anodize Load Scheduling for Diamond Aluminum, Undergraduate Thesis, Department of Industrial Engineering, University of Toronto, Canada.
Kumar, S., Bagchi, T.P., And Sriskandarajah, C, 2000. Lot Streaming and Scheduling Heuristics for m-Machine No-Wait Flow-Shops. Computers & Industrial Engineering38, 149–172.
Potts, C.N. and K.R. Baker. 1989. Flowshop Scheduling with Lot Streaming, Operations Research Letters, 8, 4, 297–303.
Potts, C.N. and L.N. Van Wassenhove. 1992. Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity, Journal of Operational Research Society, 43, 5, 395–406.
Röck, H., and Smith, G., 1983. Machine Aggregation Heuristics in Shop-Scheduling, Methods of Operations Research, 45, pp 303–314.
Sriskandarajah, C, and Wagneur, E., 1999. Lotstreaming and Scheduling Multiple Products in Two-Machine No-Wait Flow-Shops, HE Transactions, Scheduling and Logistics, 31, 8, 695–708.
Szendrovits, A.Z. 1975. Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model, Management Science, 22, 298–308.
Trietsch, D. and K. R. Baker. 1993. Basic Techniques for Lot Streaming, Operations Research, 41, 6, 1065–1076.
Vickson, R.G. 1995. Optimal Lot Streaming for Multiple Products in a Two-machine Flowshop, European Journal of Operations Research, 85, 556–575.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wagneur, E. (2002). Lotstreaming Single Product in 3-Machine No-Wait Flow-Shops. In: Zaccour, G. (eds) Decision & Control in Management Science. Advances in Computational Management Science, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3561-1_17
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3561-1_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4995-0
Online ISBN: 978-1-4757-3561-1
eBook Packages: Springer Book Archive