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

Gruppierungs- und Reihenfolgeprobleme in der Fertigung

Author

Listed:
  • Drexl, Andreas
  • Jordan, Carsten
  • Kimms, Alf

Abstract

Gruppierungs- und Reihenfolgeprobleme der Fertigung zählen zu den zentralen Fragestellungen der (operativen) Produktionsplanung. Gruppierung bezeichnet dabei die zu treffenden Entscheidungen über Größe und zeitliche Lage von Fertigungsaufträgen (Losen), während der Reihenfolgeaspekt die Belegung der Anlagen zum Gegenstand hat. Im vorliegenden Beitrag wird ein neues (konzeptionelles) Modell vorgestellt, mit dessen Hilfe Gruppierungs- und Reihenfolgeentscheidungen bei reihenfolgeabhängigen Rüstvorgängen simultan getroffen werden können. Die Relevanz des neuen Ansatzes wird durch ausgewählte kompetitive numerische Ergebnisse untermauert. Schließlich wird diskutiert, wie sich das vorgeschlagene Gruppierungs- und Reihenfolgemodell verallgemeinern läßt.

Suggested Citation

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

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    2. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    3. 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.
    4. Fleischmann, B. & Meyr, H., 1997. "The General Lotsizing and Scheduling Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36068, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    6. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    7. Gary D. Eppen & R. Kipp Martin, 1987. "Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 832-848, December.
    8. Carsten Jordan & Andreas Drexl, 1995. "A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups," INFORMS Journal on Computing, INFORMS, vol. 7(2), pages 160-165, May.
    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. Fleischmann, Bernhard, 1994. "The discrete lot-sizing and scheduling problem with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 75(2), pages 395-404, June.
    11. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    12. 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.
    13. Horst Tempelmeier & Matthias Derstroff, 1996. "A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times," Management Science, INFORMS, vol. 42(5), pages 738-757, May.
    14. Tempelmeier, Horst & Helber, Stefan, 1994. "A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures," European Journal of Operational Research, Elsevier, vol. 75(2), pages 296-311, June.
    15. Stadtler, Hartmut, 1996. "Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing," European Journal of Operational Research, Elsevier, vol. 94(3), pages 561-581, November.
    16. 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.
    17. 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.
    18. Kuik, Roelof & Salomon, Marc & van Wassenhove, Luk N., 1994. "Batching decisions: structure and models," European Journal of Operational Research, Elsevier, vol. 75(2), pages 243-263, June.
    19. 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.
    20. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    21. Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
    22. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    23. Donald Erlenkotter, 1990. "Ford Whitman Harris and the Economic Order Quantity Model," Operations Research, INFORMS, vol. 38(6), pages 937-946, December.
    Full references (including those not matched with items on IDEAS)

    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, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    3. 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.
    4. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Alf Kimms, 1998. "Ablauforganisation bei Serienproduktion in Fließfertigungssystemen," Schmalenbach Journal of Business Research, Springer, vol. 50(7), pages 641-655, July.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    13. 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.
    14. 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.
    15. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    16. 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.
    17. 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.
    18. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
    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. 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.

    More about this item

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