Advanced Search
MyIDEAS: Login

The Capacitated lot-sizing problem with linked lot sizes

Contents:

Author Info

  • Suerie, Christopher
  • Stadtler, Hartmut
Registered author(s):

    Abstract

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

    as in new window
    Length:
    Date of creation: 01 Jan 2003
    Date of revision:
    Publication status: Published in Management Science . 49 (2003-01-01) : pp. 1039-1054
    Handle: RePEc:dar:wpaper:20206

    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/20206/
    Contact details of provider:
    Postal: Hochschulstr. 1, 64289 Darmstadt
    Phone: ++49 (0)6151 16-2701
    Fax: ++49 (0)6151 16-6508
    Email:
    Web page: http://www.wi.tu-darmstadt.de/fachgebiete/fachgebiete_4/betriebswirtschaftlichefachgebiete.de.jsp
    More information through EDIRC

    Related research

    Keywords:

    References

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

    Citations

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

    Cited by:
    1. 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.
    2. Tempelmeier, Horst & Buschkühl, Lisbeth, 2008. "Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource," International Journal of Production Economics, Elsevier, vol. 113(1), pages 401-412, May.
    3. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    4. 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," Diskussionspapiere der Wirtschaftswissenschaftlichen Fakultät der Leibniz Universität Hannover dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    5. Kampf, M. & Kochel, P., 2006. "Simulation-based sequencing and lot size optimisation for a production-and-inventory system with multiple items," International Journal of Production Economics, Elsevier, vol. 104(1), pages 191-200, November.
    6. Yavuz, Mesut & Tufekci, Suleyman, 2006. "A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems," International Journal of Production Economics, Elsevier, vol. 103(2), pages 841-862, October.
    7. Jenny Carolina Saldaña Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," DOCUMENTOS CEDE 008735, UNIVERSIDAD DE LOS ANDES-CEDE.

    Lists

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

    Statistics

    Access and download statistics

    Corrections

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