MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

Nabil Absi; Safia Kedad-Sidhoum

RAIRO - Operations Research (2007)

  • Volume: 41, Issue: 2, page 171-192
  • ISSN: 0399-0559

Abstract

top
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.

How to cite

top

Absi, Nabil, and Kedad-Sidhoum, Safia. "MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs." RAIRO - Operations Research 41.2 (2007): 171-192. <http://eudml.org/doc/250109>.

@article{Absi2007,
abstract = {We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported. },
author = {Absi, Nabil, Kedad-Sidhoum, Safia},
journal = {RAIRO - Operations Research},
keywords = {Lot-sizing; setup time; shortage cost; safety stock deficit; production planning; mixed integer programming; heuristic; lot-sizing},
language = {eng},
month = {6},
number = {2},
pages = {171-192},
publisher = {EDP Sciences},
title = {MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs},
url = {http://eudml.org/doc/250109},
volume = {41},
year = {2007},
}

TY - JOUR
AU - Absi, Nabil
AU - Kedad-Sidhoum, Safia
TI - MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
JO - RAIRO - Operations Research
DA - 2007/6//
PB - EDP Sciences
VL - 41
IS - 2
SP - 171
EP - 192
AB - We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.
LA - eng
KW - Lot-sizing; setup time; shortage cost; safety stock deficit; production planning; mixed integer programming; heuristic; lot-sizing
UR - http://eudml.org/doc/250109
ER -

References

top
  1. N. Absi, Modélisation et résolution de problèmes de lot-sizing à capacité finie. Ph.D. thesis, Université Pierre et Marie Curie (Paris VI), (2005).  
  2. N. Absi and S. Kedad-Sidhoum, Multi-item capacitated lot-sizing problem with setup times and shortage costs. Working paper, Available at , July 2005.  URIhttp://www.optimization-online.org/DB_HTML/2005/09/1212.html
  3. D. Aksen, K. Altinkemer and S. Chand, The single-item lot-sizing problem with immediate lost sales. Eur. J. Oper. Res.147 (2003) 558–566.  
  4. G. Belvaux and L.A. Wolsey, bc-prod: A specialized branch-and-cut system for lot-sizing problems. Manage. Sci.46 (2000) 724–738.  
  5. G. Bitran and H.H. Yanasse, Computational complexity of the capacitated lot size problem. Manage. Sci.28 (1982) 1174–1186.  
  6. N. Brahimi, S. Dauzère-Pérès, N.M. Najid and A. Nordli, Single item lot sizing problems. Eur. J. Oper. Res.168 (2006) 1–16.  
  7. W.H. Chen and J.M. Thizy, Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann. Oper. Res.26 (1990) 29–72.  
  8. A.R. Clark, Hybrid heuristics for planning lot setups and sizes. Comput. Ind. Eng.44 (2003) 545–562.  
  9. M. Diaby, H.C. Bahl, M.H. Karwan and S. Zionts, Capacitated lot-sizing and scheduling by lagrangean relaxation. Eur. J. Oper. Res.59 (1992) 444–458.  
  10. J.R. Evans, An efficient implementation of the wagner-whitin algorithm for dynamic lot-sizing. J. Oper. Manage.5 (1982) 229–235.  
  11. M. Florian, J.K. Lenstra and A.H.G. Rinnoy Kan, Deterministic production planning: algorithms and complexity. Manage. Sci.26 (1980) 669–679.  
  12. J.D. Kelly, Chronological decomposition heuristic for scheduling: A divide and conquer method. AIChE Journal48 (2002) 2995–2999.  
  13. J. Krarup and O. Bilde, Plant location, set covering and economic lot sizes: An o(mn)-algorithm for structured problems, in optimierung bei graphentheoretischen and ganzzahligen probleme, edited by L. Collatz et al., Birkhauser Verlag, Basel (1977) 155–180.  
  14. J.M. Leung, T.L. Magnanti and R. Vachani, Facets and algorithms for capacitated lot-sizing. Math. Program.45 (1989) 331–359.  
  15. CPLEX Callable Library. Ilog sa. (2005).  URIhttp://www.ilog.com
  16. M. Loparic, Y. Pochet and L.A. Wolsey, The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program.89 (2001) 487–504.  
  17. LOTSIZELIB. http://www.core.ucl.ac.be:16080/wolsey/lotsizel.htm (1999).  
  18. C. Mercé and G. Fontan, Mip-based heuristics for capacitated lotsizing problems. Inter. J. Prod. Econ.85 (2003) 97–111.  
  19. A.J. Miller, Polyhedral Approaches to Capacitated Lot-Sizing Problems. Ph.D. thesis, Georgia Institute of Technology, USA (1999).  
  20. A.J. Miller, G.L. Nemhauser and M.W.P. Savelsbergh, On the polyhedral structure of a multi-item production planning model with setup times. Math. Program.94 (2003) 375–405.  
  21. Y. Pochet and L.A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes. Manage. Sci.37 (1991) 53–67.  
  22. R. Roundy. Efficient, effective lot-sizing for multi-product, multi-stage production systems. Oper. Res.41 (1993) 371–386.  
  23. R.A. Sandbothe and G.L. Thompson, A forward algorithm for the capacitated lot size model with stockouts. Oper. Res.38 (1990) 474–486.  
  24. H. Stadtler, Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res.51 (2003) 487–502.  
  25. C. Suerie and H. Stadtler, The capacitated lot-sizing problem with linked lot sizes. Manage. Sci.49 (2003) 1039–1054.  
  26. W. Trigeiro, L.J. Thomas and J.O. McLain, Capacitated lot-sizing with setup times. Manage. Sci.35 (1989) 353–366.  
  27. M. Van Vyve and Y. Pochet, A general heuristic for production planning problems. INFORMS J. Comput.16 (2004) 316–327.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.