OR Spectrum

, Volume 39, Issue 1, pp 321–345 | Cite as

Scheduling the replenishment of just-in-time supermarkets in assembly plants

  • Simon EmdeEmail author
Regular Article


In recent years, many OEMs, especially in the automotive industry, have installed so-called supermarkets on their shopfloors to feed parts to assembly lines in a flexible and just-in-time manner. Supermarkets are small logistics areas within the factory where parts are intermediately stored to be transferred, often in the form of presorted kits, to nearby workstations frequently and in small lots. While this greatly alleviates inventory concerns at the assembly line, care must be taken that the supermarket itself always be adequately stocked. In this paper, we tackle the problem of determining when which part types should be taken from central receiving storage to the supermarket in what quantities, such that, on the one hand, shopfloor traffic remains manageable, while, on the other hand, inventory costs are not excessive. We formalize the problem, investigate the computational complexity, and develop a bounding procedure as well as a heuristic decomposition approach. Computational tests show that our procedures work very well on instances of realistic size. Moreover, we study the tradeoff inherent in the problem between delivery frequency and in-process inventory.


Mixed-model assembly lines Just-in-time Dynamic lot-sizing Production logistics Supermarket 


  1. Akbalik A, Kebe S, Penz B, Sbihi N (2008) Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem. Int Trans Oper Res 15:195–214CrossRefGoogle Scholar
  2. Akbalik A, Penz B, Rapine C (2015) Capacitated lot sizing problems with inventory bounds. Ann Oper Res 229:1–18CrossRefGoogle Scholar
  3. Bartholdi JJ, Hackman ST (2008) Allocating space in a forward pick area of a distribution center for small parts. IIE Trans 40:1046–1053CrossRefGoogle Scholar
  4. Bartholdi JJ, Hackman ST (2014) Warehouse and distribution science, release 0.96. Internet. Accessed 21 Oct 2015
  5. Battini D, Faccio M, Persona A, Sgarbossa F (2010) “Supermarket warehouses”: stocking policies optimization in an assembly-to-order environment. Int J Adv Manuf Technol 50:775–788CrossRefGoogle Scholar
  6. Battini D, Boysen N, Emde S (2013) Just-in-time supermarkets for part supply in the automobile industry. J Manag Control 24:209–217CrossRefGoogle Scholar
  7. Boysen N, Fliedner M, Scholl A (2008) Sequencing mixed-model assembly lines to minimize part inventory cost. OR Spectr 30:611–633CrossRefGoogle Scholar
  8. Boysen N, Scholl A, Wopperer N (2012) Resequencing of mixed-model assembly lines: survey and research agenda. Eur J Oper Res 216:594–604CrossRefGoogle Scholar
  9. Boysen N, Emde S, Hoeck M, Kauderer M (2015) Part logistics in the automotive industry: decision problems, literature review and research agenda. Eur J Oper Res 242:107–120CrossRefGoogle Scholar
  10. Dixon PS, Poh CL (1990) Heuristic procedures for multi-item inventory planning with limited storage. IIE Trans 22:112–123CrossRefGoogle Scholar
  11. Drexl A, Kimms A (1997) Lot sizing and scheduling-survey and extensions. Eur J Oper Res 99:221–235CrossRefGoogle Scholar
  12. Emde S, Fliedner M, Boysen N (2012) Optimally loading tow trains for JIT-supply of mixed-model assembly lines. IIE Trans 44:121–135CrossRefGoogle Scholar
  13. Emde S, Boysen N (2012a) Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines. Eur J Oper Res 217:287–299Google Scholar
  14. Emde S, Boysen N (2012b) Optimally locating in-house logistics areas to facilitate JIT-supply of mixed-model assembly lines. Int J Prod Econ 135:393–402CrossRefGoogle Scholar
  15. Fathi M, Alvarez MJ, Hassani Mehraban F, Rodriguez V (2014) A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines. Math Probl Eng 2014:2014CrossRefGoogle Scholar
  16. Fisher ML, Ittner CD (1999) The impact of product variety on automobile assembly operations: empirical evidence and simulation analysis. Manag Sci 45:771–786CrossRefGoogle Scholar
  17. Frazelle EH, Hackman ST, Passy U, Platzman LK (1994) The forward–reserve problem. In: Ciriani T, Leachman R (eds) Optimization in industry, vol 2. Wiley, HobokenGoogle Scholar
  18. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New YorkGoogle Scholar
  19. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40:1276–1290CrossRefGoogle Scholar
  20. Glover F (1977) Heuristic for integer programming using surrogate constraints. Decis Sci 8:156–166CrossRefGoogle Scholar
  21. Golz J, Gujjula R, Gunther H-O, Rinderer S, Ziegler M (2012) Part feeding at high-variant mixed-model assembly lines. Flex Serv Manuf J 24:119–141CrossRefGoogle Scholar
  22. Gu J, Goetschalckx M, McGinnis LF (2010) Solving the forward–reserve allocation problem in warehouse order picking systems. J Oper Res Soc 61:1013–1021CrossRefGoogle Scholar
  23. Gutiérrez J, Colebrook M, Abdul-Jalbar B, Sicilia J (2013) Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities. Comput Oper Res 40:2844–2851CrossRefGoogle Scholar
  24. Hackman ST, Platzman LK (1990) Near-optimal solution of generalized resource location problems with large capacities. Oper Res 38:902–910CrossRefGoogle Scholar
  25. Hackman ST, Rosenblatt MJ, Olin JM (1990) Allocating items to an automated storage and retrieval system. IIE Trans 22:7–14CrossRefGoogle Scholar
  26. Hertz A (1992) Finding a feasible course schedule using tabu search. Discret Appl Math 35:255–270CrossRefGoogle Scholar
  27. Hogg R (2015) Skoda: simply clever logistics. Automotive logistics magazine, Internet. Accessed 21 Oct 2015
  28. Karimi B, Ghomi SF, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365–378CrossRefGoogle Scholar
  29. Klier TH, Rubenstein JM (2008) Who really made your car?: restructuring and geographic change in the auto industry. W.E. Upjohn Institute for Employment Research, KalamazooCrossRefGoogle Scholar
  30. Lasdon LS, Terjung RC (1971) An efficient algorithm for multi-item scheduling. Oper Res 19:946–969CrossRefGoogle Scholar
  31. Limère V, Van Landeghem H, Goetschalckx M, Aghezzaf E-H, McGinnis LF (2012) Optimising part feeding in the automotive assembly industry: deciding between kitting and line stocking. Int J Prod Res 50:4046–4060CrossRefGoogle Scholar
  32. Minner S (2009) A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity. Int J Prod Econ 118:305–310CrossRefGoogle Scholar
  33. Monden Y (2011) Toyota production system: an integrated approach to just-in-time, 4th edn. CRC Press, Boca RatonGoogle Scholar
  34. Ohno T (1988) Toyota production system: beyond large-scale production. CRC Press, Boca RatonGoogle Scholar
  35. Saigal R (1968) Letter to the editor—A constrained shortest route problem. Oper Res 16:205–209CrossRefGoogle Scholar
  36. Taylor LJ III (1999) A simulation study of WIP inventory drive systems and their effect on financial measurements. Integr Manuf Syst 10(5):306–315Google Scholar
  37. Vaidyanathan BS, Matson JO, Miller DM, Matson JE (1999) A capacitated vehicle routing problem for just-in-time delivery. IIE Trans 31:1083–1092Google Scholar
  38. Van den Berg JP, Sharp GP, Gademann AJRM, Pochet Y (1998) Forward–reserve allocation in a warehouse with unit-load replenishments. Eur J Oper Res 111:98–113CrossRefGoogle Scholar
  39. Walter R, Boysen N, Scholl A (2013) The discrete forward-reserve problem—allocating space, selecting products, and area sizing in forward order picking. Eur J Oper Res 229:585–594CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Fachgebiet Management Science/Operations ResearchTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations