IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v39y2017i1d10.1007_s00291-016-0455-x.html
   My bibliography  Save this article

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

Author

Listed:
  • Simon Emde

    () (Technische Universität Darmstadt)

Abstract

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

Suggested Citation

  • Simon Emde, 2017. "Scheduling the replenishment of just-in-time supermarkets in assembly plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 321-345, January.
  • Handle: RePEc:spr:orspec:v:39:y:2017:i:1:d:10.1007_s00291-016-0455-x
    DOI: 10.1007/s00291-016-0455-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-016-0455-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    2. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    3. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79443, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Thomas Klier & James Rubenstein, 2008. "Who Really Made Your Car? Restructuring and Geographic change in the Auto Industry," Books from Upjohn Press, W.E. Upjohn Institute for Employment Research, number wrmyc, November.
    5. Romesh Saigal, 1968. "Letter to the Editor—A Constrained Shortest Route Problem," Operations Research, INFORMS, vol. 16(1), pages 205-209, February.
    6. Boysen, Nils & Scholl, Armin & Wopperer, Nico, 2012. "Resequencing of mixed-model assembly lines: Survey and research agenda," European Journal of Operational Research, Elsevier, vol. 216(3), pages 594-604.
    7. Marshall L. Fisher & Christopher D. Ittner, 1999. "The Impact of Product Variety on Automobile Assembly Operations: Empirical Evidence and Simulation Analysis," Management Science, INFORMS, vol. 45(6), pages 771-786, June.
    8. van den Berg, Jeroen P. & Sharp, Gunter P. & Gademann, A. J. R. M. (Noud) & Pochet, Yves, 1998. "Forward-reserve allocation in a warehouse with unit-load replenishments," European Journal of Operational Research, Elsevier, vol. 111(1), pages 98-113, November.
    9. L. S. Lasdon & R. C. Terjung, 1971. "An Efficient Algorithm for Multi-Item Scheduling," Operations Research, INFORMS, vol. 19(4), pages 946-969, August.
    10. Minner, Stefan, 2009. "A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity," International Journal of Production Economics, Elsevier, vol. 118(1), pages 305-310, March.
    11. Ayse Akbalik & Bernard Penz & Christophe Rapine, 2015. "Capacitated lot sizing problems with inventory bounds," Annals of Operations Research, Springer, vol. 229(1), pages 1-18, June.
    12. Steven T. Hackman & Loren K. Platzman, 1990. "Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities," Operations Research, INFORMS, vol. 38(5), pages 902-910, October.
    13. Battini, Daria & Boysen, Nils & Emde, Simon, 2013. "Just-in-Time supermarkets for part supply in the automobile industry," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79438, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    14. Daria Battini & Nils Boysen & Simon Emde, 2013. "Just-in-Time supermarkets for part supply in the automobile industry," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 24(2), pages 209-217, July.
    15. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    Full references (including those not matched with items on IDEAS)

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:orspec:v:39:y:2017:i:1:d:10.1007_s00291-016-0455-x. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.