Advertisement

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

  • Liming Yao
  • Subhash C. SarinEmail author
Chapter
Part of the International Series in Operations Research & Management Science book series (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.

Keywords

Scheduling Assembly system Lot streaming Branch-and-bound Makespan 

References

  1. Baker, K. R. (1995). Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 57, 1–11.Google Scholar
  2. 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
  3. 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
  4. 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
  5. 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
  6. Johnson, S. M. (1954). Optimal two- and three-stage production schedule with setup times included. Naval Research Logistics, 1(1), 61–68.Google Scholar
  7. 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
  8. 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
  9. 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
  10. Potts, C. N., & Baker, K. R. (1989). Flow shop scheduling with lot streaming. Operation Research Letters, 8, 297–303.Google Scholar
  11. 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
  12. 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
  13. 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
  14. Trietsch, D. (1987). Optimal transfer lots for batch manufacturing. Manuscript presented at the ORSA/TIMS Conference.Google Scholar
  15. 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
  16. 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

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Grado Department of Industrial and Systems EngineeringVirginia TechBlacksburgUSA

Personalised recommendations