Advanced Search
MyIDEAS: Login

Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows


Author Info

  • Stadtler, Hartmut
Registered author(s):


    No abstract is available for this item.

    Download Info

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below under "Related research" whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Bibliographic Info

    Paper provided by Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL) in its series Publications of Darmstadt Technical University, Institute for Business Studies (BWL) with number 20204.

    as in new window
    Date of creation: 01 Jan 2003
    Date of revision:
    Publication status: Published in Operations Research, Informs . 51 (2003-01-01) : pp. 487-502
    Handle: RePEc:dar:wpaper:20204

    Note: for complete metadata visit
    Contact details of provider:
    Postal: Hochschulstr. 1, 64289 Darmstadt
    Phone: ++49 (0)6151 16-2701
    Fax: ++49 (0)6151 16-6508
    Web page:
    More information through EDIRC

    Related research



    No references listed on IDEAS
    You can help add them by filling out this form.


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

    Cited by:
    1. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    2. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    3. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    4. Jans, R.F., 2006. "Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints," ERIM Report Series Research in Management ERS-2006-051-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 Uni.
    5. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    6. Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
    7. Awi Federgruen & Joern Meissner & Michal Tzur, 2002. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Working Papers MRG/0001, Department of Management Science, Lancaster University, revised Nov 2004.
    8. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    9. Helber, Stefan & Sahling, Florian, 2008. "A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems," Hannover Economic Papers (HEP) dp-393, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    10. Awi Federgruen & Joern Meissner, 2004. "Probabilistic Analysis of Multi-Item Capacitated Lot Sizing Problems," Working Papers MRG/0004, Department of Management Science, Lancaster University, revised Apr 2005.
    11. POCHET, Yves & WARICHET, François, 2007. "A tighter continuous time formulation for the cyclic scheduling of a mixed plant," CORE Discussion Papers 2007026, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    13. Dudek, Gregor & Stadtler, Hartmut, 2005. "Negotiation-based collaborative planning between supply chains partners," European Journal of Operational Research, Elsevier, vol. 163(3), pages 668-687, June.
    14. 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.
    15. Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
    16. Boulaksil, Youssef & Fransoo, Jan C., 2009. "Order release strategies to control outsourced operations in a supply chain," International Journal of Production Economics, Elsevier, vol. 119(1), pages 149-160, May.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:dar:wpaper:20204. 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: (Dekanatssekretariat).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.