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

Lotsizing and scheduling by batch sequencing

Author

Listed:
  • Jordan, Carsten
  • Drexl, Andreas

Abstract

The discrete lotsizing and scheduling problem with setup-times is transformed into a single-machine scheduling problem, denoted as batch sequencing problem, which integrates sequence-dependent setups as well. The relationship between the lotsizing and the batch sequencing problem is analyzed. The batch sequencing problem is solved with an enumerative algorithm which is accelerated through bounding and dominance rules. Computational results show that this algorithm solves even the special case of sequence-independent setups more efficiently than a procedure for the discrete lotsizing and scheduling problem which has been recently published.

Suggested Citation

  • Jordan, Carsten & Drexl, Andreas, 1994. "Lotsizing and scheduling by batch sequencing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 343, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  • Handle: RePEc:zbw:cauman:343
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    2. Dirk Cattrysse & Marc Salomon & Roelof Kuik & Luk N. Van Wassenhove, 1993. "A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times," Management Science, INFORMS, vol. 39(4), pages 477-486, April.
    3. André Gascon & Robert C. Leachman, 1988. "A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem," Operations Research, INFORMS, vol. 36(1), pages 50-56, February.
    4. 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.
    5. T. L. Magnanti & R. Vachani, 1990. "A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs," Operations Research, INFORMS, vol. 38(3), pages 456-473, June.
    6. L. S. Lasdon & R. C. Terjung, 1971. "An Efficient Algorithm for Multi-Item Scheduling," Operations Research, INFORMS, vol. 19(4), pages 946-969, August.
    7. Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    8. 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. Jordan, Carsten, 1995. "A two-phase genetic algorithm to solve variants of the batch sequencing problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 363, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. repec:dgr:rugsom:95a37 is not listed on IDEAS
    3. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    4. 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.
    5. Salomon, Marc & Solomon, Marius M. & Van Wassenhove, Luk N. & Dumas, Yvan & Dauzere-Peres, Stephane, 1997. "Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows," European Journal of Operational Research, Elsevier, vol. 100(3), pages 494-513, August.

    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. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
    2. 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.
    3. 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.
    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. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    6. 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.
    7. 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.
    8. Salomon, Marc & Solomon, Marius M. & Van Wassenhove, Luk N. & Dumas, Yvan & Dauzere-Peres, Stephane, 1997. "Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows," European Journal of Operational Research, Elsevier, vol. 100(3), pages 494-513, August.
    9. Jordan, Carsten, 1995. "A two-phase genetic algorithm to solve variants of the batch sequencing problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 363, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Bruggemann, Wolfgang & Jahnke, Hermann, 2000. "The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability," European Journal of Operational Research, Elsevier, vol. 124(3), pages 511-528, August.
    11. Sungmin Kang & Kavindra Malik & L. Joseph Thomas, 1999. "Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs," Management Science, INFORMS, vol. 45(2), pages 273-289, February.
    12. 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.
    13. Ozdamar, Linet & Birbil, Sevket Ilker, 1998. "Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions," European Journal of Operational Research, Elsevier, vol. 110(3), pages 525-547, November.
    14. Milind Dawande & Srinagesh Gavirneni & Yinping Mu & Suresh Sethi & Chelliah Sriskandarajah, 2010. "On the Interaction Between Demand Substitution and Production Changeovers," Manufacturing & Service Operations Management, INFORMS, vol. 12(4), pages 682-691, September.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:343. 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.