IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v174y2006i2p874-886.html
   My bibliography  Save this article

Modeling of period overlapping setup times

Author

Listed:
  • Suerie, Christopher

Abstract

No abstract is available for this item.

Suggested Citation

  • Suerie, Christopher, 2006. "Modeling of period overlapping setup times," European Journal of Operational Research, Elsevier, vol. 174(2), pages 874-886, October.
    • Handle: RePEc:eee:ejores:v:174:y:2006:i:2:p:874-886
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00377-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Christopher Suerie & Hartmut Stadtler, 2003. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes," Management Science, INFORMS, vol. 49(8), pages 1039-1054, August.
    2. Willard I. Zangwill, 1987. "From EOQ Towards ZI," Management Science, INFORMS, vol. 33(10), pages 1209-1223, October.
    3. 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.
    4. James D. Blocher & Suresh Chand & Kaushik Sengupta, 1999. "The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm," Operations Research, INFORMS, vol. 47(4), pages 559-569, August.
    5. 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.
    6. Suerie, Christopher & Stadtler, Hartmut, 2003. "The Capacitated lot-sizing problem with linked lot sizes," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20206, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    7. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    8. K S Hindi & K Fleszar & C Charalambous, 2003. "An effective heuristic for the CLSP with set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 490-498, May.
    9. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    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. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    2. 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.
    3. Lee, Younsoo & Lee, Kyungsik, 2022. "New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 302(1), pages 230-243.
    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. Sheng-I Chen & Delvinia Su, 2022. "A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups," Annals of Operations Research, Springer, vol. 311(1), pages 35-50, April.
    6. Masoumeh Mahdieh & Alistair Clark & Mehdi Bijari, 2018. "A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 884-923, December.
    7. 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.
    8. Matthias Gerhard Wichmann & Christoph Johannes & Thomas Stefan Spengler, 2019. "An extension of the general lot-sizing and scheduling problem (GLSP) with time-dependent energy prices," Journal of Business Economics, Springer, vol. 89(5), pages 481-514, July.

    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, 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.
    2. 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.
    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. 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.
    5. 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.
    6. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    7. 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.
    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. Józefowska, J. & Zimniak, A., 2008. "Optimization tool for short-term production planning and scheduling," International Journal of Production Economics, Elsevier, vol. 112(1), pages 109-120, March.
    10. 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," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    11. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    12. 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.
    13. 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.
    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. Bruno, Giuseppe & Genovese, Andrea & Piccolo, Carmela, 2014. "The capacitated Lot Sizing model: A powerful tool for logistics decision making," International Journal of Production Economics, Elsevier, vol. 155(C), pages 380-390.
    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. 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. 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.
    19. Alf Kimms, 1998. "Ablauforganisation bei Serienproduktion in Fließfertigungssystemen," Schmalenbach Journal of Business Research, Springer, vol. 50(7), pages 641-655, July.
    20. Sahling, Florian & Hahn, Gerd J., 2019. "Dynamic lot sizing in biopharmaceutical manufacturing," International Journal of Production Economics, Elsevier, vol. 207(C), pages 96-106.

    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:eee:ejores:v:174:y:2006:i:2:p:874-886. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.