IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/329.html
   My bibliography  Save this paper

Multi-level, single-machine lot sizing and scheduling: With initial inventory

Author

Listed:
  • Kimms, Alf

Abstract

This paper presents a mixed-integer program for the dynamic lot sizing and scheduling problem in a multi-level, single-machine environment. It turns out that in contrast to single-level problems the integration of initial inventory is a crucial aspect if generality should not be lost. It is shown how problem instances can efficiently be solved to suboptimality by using a so-called randomized regret based heuristic.

Suggested Citation

  • Kimms, Alf, 1993. "Multi-level, single-machine lot sizing and scheduling: With initial inventory," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 329, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    • Handle: RePEc:zbw:cauman:329
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/149826/1/manuskript_329.pdf
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Singh, Kumar Ashutosh & Mukherjee, Atreya & Tiwari, M. K., 2004. "Incorporating kin selection in simulated annealing algorithm and its performance evaluation," European Journal of Operational Research, Elsevier, vol. 158(1), pages 34-45, October.
    2. Fandel, Gunter & Stammen-Hegene, Cathrin, 2006. "Simultaneous lot sizing and scheduling for multi-product multi-level production," International Journal of Production Economics, Elsevier, vol. 104(2), pages 308-316, December.
    3. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    4. Haase, Knut & Kimms, Alf, 1996. "Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 393, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:zbw:cauman:329. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.html .

    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.