IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/393.html

Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities

Author

Listed:
  • Haase, Knut
  • Kimms, Alf

Abstract

This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and efficiently. Furthermore, it will become clear that rescheduling can neatly be done.

Suggested Citation

  • 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.
    • Handle: RePEc:zbw:cauman:393
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. Kimms, Alf, 1994. "Complementary, competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 348, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. 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.
    4. VAN ROY, Tony J. & WOLSEY, Laurence A., 1987. "Solving mixed integer programming problems using automatic reformulation," LIDAM Reprints CORE 782, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Tony J. Van Roy & Laurence A. Wolsey, 1987. "Solving Mixed Integer Programming Problems Using Automatic Reformulation," Operations Research, INFORMS, vol. 35(1), pages 45-57, February.
    6. Gregory Dobson, 1992. "The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups," Operations Research, INFORMS, vol. 40(4), pages 736-749, August.
    7. Uday S. Karmarkar & Sham Kekre & Sunder Kekre, 1987. "The Dynamic Lot-Sizing Problem with Startup and Reservation Costs," Operations Research, INFORMS, vol. 35(3), pages 389-398, June.
    8. Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
    9. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    10. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    11. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    12. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    13. Gabriel R. Bitran & Hirofumi Matsuo, 1986. "The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations," Management Science, INFORMS, vol. 32(3), pages 350-359, March.
    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. Bouchriha, Hanen & Ouhimmou, Mustapha & D'Amours, Sophie, 2007. "Lot sizing problem on a paper machine under a cyclic production approach," International Journal of Production Economics, Elsevier, vol. 105(2), pages 318-328, February.
    2. Kimms, Alf & Drexl, Andreas, 1996. "Shortcomings of MRP II and a new planning meta-method," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 404, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    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. 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.
    5. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
    6. Alf Kimms, 1998. "Ablauforganisation bei Serienproduktion in Fließfertigungssystemen," Schmalenbach Journal of Business Research, Springer, vol. 50(7), pages 641-655, July.
    7. 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.
    8. Drexl, Andreas & Haase, Knut, 1997. "Vorbeugende Instandhaltung und Eilaufträge in der Produktionsplanung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 450, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. 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.
    10. Jordan, Carsten & Drexl, Andreas, 1997. "Discrete lotsizing and scheduling by batch sequencing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 438, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. 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.
    12. 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.

    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. 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.
    2. 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.
    3. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    4. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    5. 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.
    6. 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.
    7. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    8. 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.
    9. 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.
    10. 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.
    11. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    12. 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.
    13. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    14. 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.
    15. Kimms, Alf & Drexl, Andreas, 1996. "Shortcomings of MRP II and a new planning meta-method," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 404, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Kumar Rajaram & Uday S. Karmarkar, 2002. "Product Cycling With Uncertain Yields: Analysis and Application to the Process Industry," Operations Research, INFORMS, vol. 50(4), pages 680-691, August.
    17. Christopher Suerie & Hartmut Stadtler, 2003. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes," Management Science, INFORMS, vol. 49(8), pages 1039-1054, August.
    18. Kimms, Alf, 1996. "Stability measures for rolling schedules with applications to capacity expansion planning, master production scheduling, and lot sizing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 418, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    20. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

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