Abstract
In this chapter, we address a lot streaming problem for a two-stage assembly system involving multiple lots with the objective of minimizing the makespan. Each lot consists of items of a unique product type. We designate this problem as a multiple-lot, two-stage assembly, lot streaming problem (ML-TSALSP) which combines two key decisions: lot splitting and lot sequencing. While the problem of scheduling in such a machine environment has been addressed in the literature, our problem is different because of the presence of the streaming of a lot over the stages. We derive some structural properties for this problem, and develop a branch-and-bound-based solution procedure that relies on effective lower bounds and dominance properties. Our computational investigation reveals the efficacy of the proposed branch-and-bound-based methodology for this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Baker, K. R. (1995). Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 57, 1–11.
Cetinkaya, F. C. (1994). Lot streaming in a two-stage flow shop with set-up, processing and removing times separated. Journal of Operations Research Society, 45(12), 1445–1455.
Cetinkaya, F. C., & Kayaligil, M. S. (1992). Unit-sized transfer batch scheduling with setup times. Computers and Industrial Engineering, 22(2), 177–182.
Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research, 12, 665–679.
Hariri, A. M. A., & Potts, C. N. (1997). A branch- and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103, 547–556.
Johnson, S. M. (1954). Optimal two- and three-stage production schedule with setup times included. Naval Research Logistics, 1(1), 61–68.
Kalir, A., & Sarin, S. C. (2000). Evaluation of potential benefits of lot streaming in flow-shop systems. International Journal of Production Economics, 66, 131–142.
Kalir, A., & Sarin, S. C. (2003). Constructing near optimal schedules for the flow shop lot streaming problem with sublot-attached setups. Journal of Combinatorial Optimization, 7, 23–44.
Lee, C.-Y., Cheng, T. C. E., & Lin, B. M. (1993). Minimizing the makespan in the 3-machine assembly-type flow shop scheduling problem. Management Science, 39(5), 616–625.
Potts, C. N., & Baker, K. R. (1989). Flow shop scheduling with lot streaming. Operation Research Letters, 8, 297–303.
Sarin, S. C., Yao, L., & Trietsch, D. (2011). Single-batch, lot streaming in a two-stage assembly system. Journal of Planning and Scheduling, 1, 90–108.
Sriskandarajah, C., & Wagneur, E. (1999). Lot streaming and scheduling multiple products in 2-machine no-wait flow shops. IIE Transactions, 31, 695–707.
Sun, X., Morizawa, K., & Nagasawa, H. (2003). Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. European Journal of Operational Research, 146, 498–516.
Trietsch, D. (1987). Optimal transfer lots for batch manufacturing. Manuscript presented at the ORSA/TIMS Conference.
Vickson, R. G. (1995). Optimal lot streaming for multiple products in a two-machine flow shop. European Journal of Operations Research, 85, 556–575.
Yao, L. (2008) Modeling analysis and solution approaches for some optimization problems: High multiplicity asymmetric traveling salesman, primary pharmaceutical manufacturing scheduling, and lot streaming in an assembly system,” Doctoral Dissertation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Yao, L., Sarin, S. (2014). Multiple-Lot Lot Streaming in a Two-stage Assembly System. In: Pulat, P., Sarin, S., Uzsoy, R. (eds) Essays in Production, Project Planning and Scheduling. International Series in Operations Research & Management Science, vol 200. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-9056-2_15
Download citation
DOI: https://doi.org/10.1007/978-1-4614-9056-2_15
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-9055-5
Online ISBN: 978-1-4614-9056-2
eBook Packages: Business and EconomicsBusiness and Management (R0)