Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

Sequencing mixed-model assembly lines to minimize part inventory cost

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

A mixed-model assembly line enables the joint production of different models of a common base product in intermixed model sequence (lot size one). Previous approaches for the short-term planning task of model sequencing either aim at minimizing work overload (mixed-model sequencing and car sequencing) or leveling part usages (level scheduling). However, at many manufacturers parts are consolidated by a third party logistics provider, who stocks Just-in-Time delivered parts in a consignment warehouse adjacent to the line. The manufacturer issues a complete cargo carrier (e.g. a euro-pallet) whenever his own intermediate storage of parts is depleted. Thus, the manufacturer aims at a model sequence which minimizes his own inventory costs. This paper formalizes this novel model sequencing problem and describes different heuristic and exact procedures. Furthermore, the solutions yielded by these approaches are compared to the traditional level scheduling.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bard JF, Dar-El E, Shtub A (1992) An analytic framework for sequencing mixed model assembly lines. Int J Prod Res 30:35–48

    Article  Google Scholar 

  • Bard JF, Shtub A, Joshi SB (1994) Sequencing mixed-model assembly lines to level parts usage and minimize time length. Int J Prod Res 32:2431–2454

    Article  Google Scholar 

  • Bautista J, Companys R, Corominas A (1996) Heuristics and exact algorithms for solving the Monden problem. Eur J Oper Res 88:101–131

    Article  Google Scholar 

  • Bock S, Rosenberg O, Brackel Tv (2006) Controlling mixed-model assembly lines in real-time by using distributed systems. Eur J Oper Res 168:880–904

    Article  Google Scholar 

  • Bolat A (1997) Stochastic procedures for scheduling minimum job sets on mixed model assembly lines. J Oper Res Soc 48:490–501

    Article  Google Scholar 

  • Bolat A, Savsar M, Al-Fawzan MA (1994) Algorithms for the real-time scheduling of jobs on mixed model assembly lines. Comput Oper Res 21:487–498

    Article  Google Scholar 

  • Boysen N, Fliedner M, Scholl A (2006) Level-Scheduling bei Variantenfließfertigung: Literaturüberblick, Klassifikation und Modellkritik, Jenaer Schriften zur Wirtschaftswissenschaft 26/2006

  • Boysen N, Fliedner M, Scholl A (2007) Sequencing mixed-model assembly lines: Survey, classification and model critique. Jena Research Papers in Business and Economics (JBE) 2/2007

  • Braglia M, Zavanella L (2003) Modelling an industrial strategy for inventory management in supply chains: The “Consignment Stock” case. Int J Prod Res 41:3793–3808

    Article  Google Scholar 

  • Brauner N, Crama Y (2004) The maximum deviation just-in-time scheduling problem. Discret Appl Math 134:25–50

    Article  Google Scholar 

  • Cakir A, Inman RR (1993) Modified goal chasing for products with non-zero/one bills of material. Int J Prod Res 31:107–115

    Article  Google Scholar 

  • Carraway RL, Schmidt RL (1991) An improved discrete dynamic programming algorithm for allocating resources among interdependent projects. Manage Sci 37:1195–1200

    Google Scholar 

  • Corbett CJ (2001) Stochastic inventory systems in a supply chain with asymmetric information: cycle stocks, safety stocks, and consignment stock. Oper Res 49:487–500

    Article  Google Scholar 

  • Dhamala TN, Kubiak W (2005) A brief survey of just-in-time sequencing for mixed-model systems. Int J Oper Res 2:38–47

    Google Scholar 

  • Dincbas M, Simonis H, Hentenryck Pv (1988) Solving the Car-Sequencing Problem in Contraint Logic Programming, 8th European Conference on Artif. Intelligence, London, pp 290–295

  • Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artifical Life 5:137–172

    Article  Google Scholar 

  • Drexl A, Kimms A, Matthiessen L (2006) Algorithms for the car sequencing and the level scheduling problem. J Scheduling 9:153–176

    Article  Google Scholar 

  • Duplaga EA, Hahn CK, Hur D (1996) Mixed-model assembly line sequencing at Hyundai Motor Company. Prod Inventory Manage J 37:20–26

    Google Scholar 

  • Fliedner M, Boysen N (2006) Solving the car sequencing problem via branch and bound. Eur J Oper Res (to appear)

  • Gagné C, Gravel M, Price WL (2006) Solving real car sequencing problems with ant colony optimization. Eur J Oper Res 174:1427–1448

    Article  Google Scholar 

  • Gravel M, Gagné C, Price WL (2005) Review and comparison of the three methods for the solution of the car sequencing problem. J Oper Res Soc 56:1287–1295

    Article  Google Scholar 

  • Inman RR, Bulfin RL (1991) Sequencing JIT mixed model assembly lines. Manage Sci 37:901–904

    Google Scholar 

  • Joo S-H, Wilhelm WE (1993) A review of quantitative approaches in just-in-time manufacturing. Prod Plann Control 4:207–222

    Article  Google Scholar 

  • Klampfl E, Gusikhin O, Rossi G (2006) Optimization of workcell layouts in a mixed-model assembly line environment. Int J Flex Manuf Syst 17:277–299

    Google Scholar 

  • Kubiak W (1993) Minimizing variation of production rates in just-in-time systems: A survey. Eur J Oper Res 66:259–271

    Article  Google Scholar 

  • Kubiak W (2003) Cyclic just-in-time sequences are optimal. J Global Optim 27:333–347

    Article  Google Scholar 

  • Kubiak W, Sethi SP (1991) A note on “level schedules for mixed-model assembly lines in just-in-time production systems”. Manage Sci 37:121–122

    Google Scholar 

  • Macaskill JLC (1973) Computer simulation for mixed-model production lines. Manage Sci 20:341–348

    Google Scholar 

  • Marsten RE, Morin TL (1978) A hybrid approach to discrete mathematical programming. Math Program 14:21–40

    Article  Google Scholar 

  • Mather H (1989) Competitive manufacturing. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Miltenburg J (1989) Level Schedules for mixed-model assembly lines in just-in-time production systems. Manage Sci 35:192–207

    Google Scholar 

  • Miltenburg J, Goldstein T (1991) Developing production schedules which balance part usage and smooth production loads for just-in-time production systems. Naval Res Logist 38:893–910

    Google Scholar 

  • Monden Y (1998) Toyota production system: an integrated approach to just-in-time, 3rd edition. Norcross

  • Morin TL, Marsten RE (1976) Branch-and-bound strategies for dynamic programming. Oper Res 24:611–627

    Google Scholar 

  • Mulligan RM (1998) EDI in foreign trade. Case studies in utilisation. Int J Phys Distrib Logist Manage 28:794–804

    Article  Google Scholar 

  • Parrello B, Kabat W, Wos L (1986) Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem. J Autom Reason 2:1–42

    Article  Google Scholar 

  • Pine BJ (1993) Mass customization: the new frontier in business competition. Harvard Business School Press, Boston

    Google Scholar 

  • Scholl A, Klein R, Domschke W (1998) Pattern based vocabulary building for effectively sequencing mixed-model assembly lines. J Heuristics 4:359–381

    Article  Google Scholar 

  • Solnon C, Cung VD, Nguyen A, Artigues C (2006) The car sequencing problem: Overview of the state-of-the art methods and industrial case-study of the ROADEF’2005 challenge problem. Eur J Oper Res (to appear)

  • Steiner G, Yeomans JS (1993) Level schedules for mixed-model, just-in-time processes. Manage Sci 39:728–735

    Google Scholar 

  • Stützle T, Dorigo M (1999) ACO algorithms for the quadratic assignment problem. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 33–50

    Google Scholar 

  • Thomopoulos NT (1967) Line balancing-sequencing for mixed-model assembly. Manage Sci 14:59–75

    Google Scholar 

  • Valentini G, Zavanella L (2003) The consignment stock of inventories: industrial case and performance analysis. Int J Prod Econ 81–82:215–224

    Article  Google Scholar 

  • Wester L, Kilbridge M (1964) The assembly line model-mix sequencing problem. Third international conference on Operations Research, Oslo 1963, pp 247–260

  • Yano CA, Bolat A (1989) Survey, development, and application of algorithms for sequencing paced assembly lines. J Manuf Oper Manage 2:172–198

    Google Scholar 

  • Yano CA, Rachamadugu R (1991) Sequencing to minimize work overload in assembly lines with product options. Manage Sci 37:572–586

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Industrielles Management, Universität Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Nils Boysen & Malte Fliedner

  2. Friedrich-Schiller-Universität Jena, Carl-Zeiß-Straße 3, 07743, Jena, Germany

    Armin Scholl

Authors
  1. Nils Boysen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malte Fliedner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Armin Scholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nils Boysen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boysen, N., Fliedner, M. & Scholl, A. Sequencing mixed-model assembly lines to minimize part inventory cost. OR Spectrum 30, 611–633 (2008). https://doi.org/10.1007/s00291-007-0095-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-007-0095-2

Keywords

Search

Navigation