IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v44y1997i4p319-340.html
   My bibliography  Save this article

Demand shuffle—A method for multilevel proportional lot sizing and scheduling

Author

Listed:
  • A. Kimms

Abstract

This contribution acquaints the reader with a model for multilevel single‐machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short‐term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduling, which is of great practical importance. The PLSP model refines well‐known mixed‐integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the DLSP or the CSLP. A special emphasis is given on a new method called demand shuffle to solve multilevel PLSP instances efficiently but suboptimally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the presented approach decidedly improves recent results. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 319–340, 1997

Suggested Citation

  • A. Kimms, 1997. "Demand shuffle—A method for multilevel proportional lot sizing and scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 319-340, June.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:4:p:319-340
    DOI: 10.1002/(SICI)1520-6750(199706)44:43.0.CO;2-9
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199706)44:43.0.CO;2-9
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199706)44:43.0.CO;2-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Robin O. Roundy, 1993. "Efficient, Effective Lot Sizing for Multistage Production Systems," Operations Research, INFORMS, vol. 41(2), pages 371-385, April.
    2. Maes, Johan & McClain, John O. & Van Wassenhove, Luk N., 1991. "Multilevel capacitated lotsizing complexity and LP-based heuristics," European Journal of Operational Research, Elsevier, vol. 53(2), pages 131-148, July.
    3. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    4. Horst Tempelmeier & Matthias Derstroff, 1996. "A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times," Management Science, INFORMS, vol. 42(5), pages 738-757, May.
    5. Panayotis Afentakis & Bezalel Gavish & Uday Karmarkar, 1984. "Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems," Management Science, INFORMS, vol. 30(2), pages 222-239, February.
    6. Tempelmeier, Horst & Helber, Stefan, 1994. "A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures," European Journal of Operational Research, Elsevier, vol. 75(2), pages 296-311, June.
    7. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    8. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    9. Kimms, A., 1996. "Multi-level, single-machine lot sizing and scheduling (with initial inventory)," European Journal of Operational Research, Elsevier, vol. 89(1), pages 86-99, February.
    10. Stadtler, Hartmut, 1994. "Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 2648, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    11. Harish C. Bahl & Larry P. Ritzman & Jatinder N. D. Gupta, 1987. "OR Practice—Determining Lot Sizes and Resource Requirements: A Review," Operations Research, INFORMS, vol. 35(3), pages 329-345, June.
    12. Paul Iyogun & Derek Atkins, 1993. "A Lower Bound and an Efficient Heuristic for Multistage Multiproduct Distribution Systems," Management Science, INFORMS, vol. 39(2), pages 204-217, February.
    13. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kaczmarczyk, Waldemar, 2020. "Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods," International Journal of Production Economics, Elsevier, vol. 219(C), pages 236-247.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kimms, Alf & Drexl, Andreas, 1996. "Multi-level lot sizing: A literature survey," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 405, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    3. Drexl, Andreas & Jordan, Carsten & Kimms, Alf, 1997. "Gruppierungs- und Reihenfolgeprobleme in der Fertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 447, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    5. Kimms, Alf, 1996. "Improved lower bounds for the proportional lot sizing and scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 414, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Alf Kimms, 1998. "Ablauforganisation bei Serienproduktion in Fließfertigungssystemen," Schmalenbach Journal of Business Research, Springer, vol. 50(7), pages 641-655, July.
    7. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Christopher Suerie & Hartmut Stadtler, 2003. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes," Management Science, INFORMS, vol. 49(8), pages 1039-1054, August.
    9. Erenguc, S. Selcuk & Simpson, N. C. & Vakharia, Asoo J., 1999. "Integrated production/distribution planning in supply chains: An invited review," European Journal of Operational Research, Elsevier, vol. 115(2), pages 219-236, June.
    10. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    12. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    13. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Kimms, Alf, 1996. "A genetic algorithm for multi-level, multi-machine lot sizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 415, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Kimms, A, 1998. "Stability Measures for Rolling Schedules with Applications to Capacity Expansion Planning, Master Production Scheduling, and Lot Sizing," Omega, Elsevier, vol. 26(3), pages 355-366, June.
    16. Simpson, N. C., 1999. "Multiple level production planning in rolling horizon assembly environments," European Journal of Operational Research, Elsevier, vol. 114(1), pages 15-28, April.
    17. Carstensen, Peter, 1997. "Das Economic Lot Scheduling Problem: Überblick und LP-basiertes Verfahren," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 465, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    19. Kimms, Alf & Drexl, Andreas, 1996. "Some insights into proportional lot sizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 406, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Kimms, Alf & Drexl, Andreas, 1996. "Proportional lot sizing and scheduling: Some extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 407, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:44:y:1997:i:4:p:319-340. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.