IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i5d10.1057_palgrave.jors.2601525.html
   My bibliography  Save this article

An effective heuristic for the CLSP with set-up times

Author

Listed:
  • K S Hindi

    (American University of Beirut (AUB))

  • K Fleszar

    (Warsaw University of Technology)

  • C Charalambous

    (Frederick Institute of Technology)

Abstract

The problem of multi-item, single level, capacitated, dynamic lot-sizing with set-up times (CLSP with set-up times) is considered. The difficulty of the problem compared with its counterpart without set-up times is explained. A lower bound on the value of the objective function is calculated by Lagrangian relaxation with subgradient optimisation. During the process, attempts are made to get good feasible solutions (ie. upper bounds) through a smoothing heuristic, followed by a local search with a variable neighbourhood. Solutions found in this way are further optimised by solving a capacitated transshipment problem. The paper describes the various elements of the solution procedure and presents the results of extensive numerical experimentation.

Suggested Citation

  • 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.
  • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:5:d:10.1057_palgrave.jors.2601525
    DOI: 10.1057/palgrave.jors.2601525
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601525
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2601525?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Agha Iqbal Ali & Rema Padman & Hemalatha Thiagarajan, 1989. "Dual Algorithms for Pure Network Problems," Operations Research, INFORMS, vol. 37(1), pages 159-171, February.
    2. William W. Trigeiro & L. Joseph Thomas & John O. McClain, 1989. "Capacitated Lot Sizing with Setup Times," Management Science, INFORMS, vol. 35(3), pages 353-366, March.
    3. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    4. 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.
    5. Edward H. Bowman, 1956. "Production Scheduling by the Transportation Method of Linear Programming," Operations Research, INFORMS, vol. 4(1), pages 100-103, February.
    6. Miller, Andrew J. & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra," European Journal of Operational Research, Elsevier, vol. 125(2), pages 298-315, September.
    7. Moustapha Diaby & Harish C. Bahl & Mark H. Karwan & Stanley Zionts, 1992. "A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing," Management Science, INFORMS, vol. 38(9), pages 1329-1340, September.
    8. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    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. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    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. Haugen, Kjetil K. & Olstad, Asmund & Pettersen, Bard I., 2007. "The profit maximizing capacitated lot-size (PCLSP) problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 165-176, January.
    4. 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.
    5. Muller, Laurent Flindt & Spoorendonk, Simon & Pisinger, David, 2012. "A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times," European Journal of Operational Research, Elsevier, vol. 218(3), pages 614-623.
    6. Sônia Poltroniere & Kelly Poldi & Franklina Toledo & Marcos Arenales, 2008. "A coupling cutting stock-lot sizing problem in the paper industry," Annals of Operations Research, Springer, vol. 157(1), pages 91-104, January.
    7. 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.
    8. 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.
    9. Suerie, Christopher, 2006. "Modeling of period overlapping setup times," European Journal of Operational Research, Elsevier, vol. 174(2), pages 874-886, October.
    10. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    11. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.

    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. 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.
    3. 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.
    4. 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.
    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. Absi, Nabil & Kedad-Sidhoum, Safia, 2008. "The multi-item capacitated lot-sizing problem with setup times and shortage costs," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1351-1374, March.
    8. 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.
    9. 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.
    10. Elena Katok & Holly S. Lewis & Terry P. Harrison, 1998. "Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources," Management Science, INFORMS, vol. 44(6), pages 859-877, June.
    11. Haugen, Kjetil K. & Olstad, Asmund & Pettersen, Bard I., 2007. "The profit maximizing capacitated lot-size (PCLSP) problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 165-176, January.
    12. 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.
    13. Andrea Raiconi & Julia Pahl & Monica Gentili & Stefan Voß & Raffaele Cerulli, 2017. "Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    14. Ozdamar, Linet & Barbarosoglu, Gulay, 2000. "An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 68(3), pages 319-331, December.
    15. 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.
    16. Petering, Matthew E.H. & Chen, Xi & Hsieh, Wen-Huan, 2019. "Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes," International Journal of Production Economics, Elsevier, vol. 212(C), pages 60-77.
    17. Zhang, Zhi-Hai & Jiang, Hai & Pan, Xunzhang, 2012. "A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain," International Journal of Production Economics, Elsevier, vol. 140(1), pages 249-255.
    18. B Karimi & S M T Fatemi Ghomi & J M Wilson, 2006. "A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 140-147, February.
    19. 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.
    20. 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.

    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:pal:jorsoc:v:54:y:2003:i:5:d:10.1057_palgrave.jors.2601525. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.