Skip to main content

Multiple-Lot Lot Streaming in a Two-stage Assembly System

  • Chapter
  • First Online:

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 200))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Baker, K. R. (1995). Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 57, 1–11.

    Google Scholar 

  • 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.

    Google Scholar 

  • Cetinkaya, F. C., & Kayaligil, M. S. (1992). Unit-sized transfer batch scheduling with setup times. Computers and Industrial Engineering, 22(2), 177–182.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedule with setup times included. Naval Research Logistics, 1(1), 61–68.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Potts, C. N., & Baker, K. R. (1989). Flow shop scheduling with lot streaming. Operation Research Letters, 8, 297–303.

    Google Scholar 

  • 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.

    Google Scholar 

  • Sriskandarajah, C., & Wagneur, E. (1999). Lot streaming and scheduling multiple products in 2-machine no-wait flow shops. IIE Transactions, 31, 695–707.

    Google Scholar 

  • 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.

    Google Scholar 

  • Trietsch, D. (1987). Optimal transfer lots for batch manufacturing. Manuscript presented at the ORSA/TIMS Conference.

    Google Scholar 

  • Vickson, R. G. (1995). Optimal lot streaming for multiple products in a two-machine flow shop. European Journal of Operations Research, 85, 556–575.

    Google Scholar 

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Subhash C. Sarin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics