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

Capacitated lot-sizing and scheduling by Lagrangean relaxation

Author

Listed:
  • Diaby, M.
  • Bahl, H. C.
  • Karwan, M. H.
  • Zionts, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Diaby, M. & Bahl, H. C. & Karwan, M. H. & Zionts, S., 1992. "Capacitated lot-sizing and scheduling by Lagrangean relaxation," European Journal of Operational Research, Elsevier, vol. 59(3), pages 444-458, June.
    • Handle: RePEc:eee:ejores:v:59:y:1992:i:3:p:444-458
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(92)90201-J
    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.

    Citations

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


    Cited by:

    1. 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.
    2. M Denizel & H Süral, 2006. "On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 389-399, April.
    3. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    4. Nascimento, Mariá C.V. & Resende, Mauricio G.C. & Toledo, Franklina M.B., 2010. "GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem," European Journal of Operational Research, Elsevier, vol. 200(3), pages 747-754, February.
    5. Armentano, Vinícius A. & França, Paulo M. & de Toledo, Franklina M. B., 1999. "A network flow model for the capacitated lot-sizing problem," Omega, Elsevier, vol. 27(2), pages 275-284, April.
    6. 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.
    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. Nazrul Shaikh & Vittal Prabhu & Danilo Abril & David Sánchez & Jorge Arias & Esteban Rodríguez & Germán Riaño, 2011. "Kimberly-Clark Latin America Builds an Optimization-Based System for Machine Scheduling," Interfaces, INFORMS, vol. 41(5), pages 455-465, October.
    9. Jing Wu & Dan Zhang & Yang Yang & Gongshu Wang & Lijie Su, 2022. "Multi-Stage Multi-Product Production and Inventory Planning for Cold Rolling under Random Yield," Mathematics, MDPI, vol. 10(4), pages 1-21, February.
    10. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    11. Willy A. Oliveira Soler & Maristela O. Santos & Kerem Akartunalı, 2025. "Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times," Journal of Heuristics, Springer, vol. 31(1), pages 1-35, March.
    12. Taş, Duygu & Gendreau, Michel & Jabali, Ola & Jans, Raf, 2019. "A capacitated lot sizing problem with stochastic setup times and overtime," European Journal of Operational Research, Elsevier, vol. 273(1), pages 146-159.
    13. Süral, Haldun & Denizel, Meltem & Van Wassenhove, Luk N., 2009. "Lagrangean relaxation based heuristics for lot sizing with setup times," European Journal of Operational Research, Elsevier, vol. 194(1), pages 51-63, April.
    14. Diego Fiorotto & Silvio Araujo, 2014. "Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines," Annals of Operations Research, Springer, vol. 217(1), pages 213-231, June.
    15. 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.
    16. 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.
    17. Fumero, Francesca & Vercellis, Carlo, 1997. "Integrating distribution, machine assignment and lot-sizing via Lagrangean relaxation," International Journal of Production Economics, Elsevier, vol. 49(1), pages 45-54, March.
    18. Hu, Zhengyang & Hu, Guiping, 2016. "A two-stage stochastic programming model for lot-sizing and scheduling under uncertainty," International Journal of Production Economics, Elsevier, vol. 180(C), pages 198-207.

    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:59:y:1992:i:3:p:444-458. 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: 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.