IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v30y1984i10p1255-1261.html
   My bibliography  Save this item

Strong Formulations for Multi-Item Capacitated Lot Sizing

Citations

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


Cited by:

  1. Doostmohammadi, Mahdi & Akartunalı, Kerem, 2018. "Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case," European Journal of Operational Research, Elsevier, vol. 267(1), pages 86-95.
  2. Mirchandani, Prakash, 2000. "Projections of the capacitated network loading problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 534-560, May.
  3. François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.
  4. BELVAUX, Gaetan & WOLSEY, Laurence A., 2000. "Modelling practical lot-sizing problems as mixed integer programs," LIDAM Discussion Papers CORE 2000009, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  5. 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.
  6. 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.
  7. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
  8. Bunn, Kevin A. & Ventura, José A., 2023. "A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs," European Journal of Operational Research, Elsevier, vol. 307(1), pages 116-129.
  9. 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.
  10. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
  11. Attila, Öykü Naz & Agra, Agostinho & Akartunalı, Kerem & Arulselvan, Ashwin, 2021. "Robust formulations for economic lot-sizing problem with remanufacturing," European Journal of Operational Research, Elsevier, vol. 288(2), pages 496-510.
  12. Absi, Nabil & van den Heuvel, Wilco, 2019. "Worst case analysis of Relax and Fix heuristics for lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 449-458.
  13. Erenguc, S. Selcuk & Simpson, N. C. & Vakharia, Asoo J., 1999. "Integrated production/distribution planning in supply chains: An invited review," European Journal of Operational Research, Elsevier, vol. 115(2), pages 219-236, June.
  14. Fabrizio Marinelli & Maria Nenni & Antonio Sforza, 2007. "Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company," Annals of Operations Research, Springer, vol. 150(1), pages 177-192, March.
  15. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
  16. 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.
  17. Franco Quezada & Céline Gicquel & Safia Kedad-Sidhoum, 2022. "Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1024-1041, March.
  18. Francesco Gaglioppa & Lisa A. Miller & Saif Benjaafar, 2008. "Multitask and Multistage Production Planning and Scheduling for Process Industries," Operations Research, INFORMS, vol. 56(4), pages 1010-1025, August.
  19. Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
  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.
  21. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
  22. James Luedtke & George L. Nemhauser, 2009. "Strategic Planning with Start-Time Dependent Variable Costs," Operations Research, INFORMS, vol. 57(5), pages 1250-1261, October.
  23. Zeger Degraeve & Raf Jans, 2007. "A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times," Operations Research, INFORMS, vol. 55(5), pages 909-920, October.
  24. 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.
  25. Silva, Eduardo M. & Melega, Gislaine M. & Akartunalı, Kerem & de Araujo, Silvio A., 2023. "Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost," European Journal of Operational Research, Elsevier, vol. 304(2), pages 443-460.
  26. Joseph Geunes & H. Edwin Romeijn & Kevin Taaffe, 2006. "Requirements Planning with Pricing and Order Selection Flexibility," Operations Research, INFORMS, vol. 54(2), pages 394-401, April.
  27. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
  28. Yilmaz, Dogacan & Büyüktahtakın, İ. Esra, 2024. "An expandable machine learning-optimization framework to sequential decision-making," European Journal of Operational Research, Elsevier, vol. 314(1), pages 280-296.
  29. Tao Wu, 2022. "Predictive Search for Capacitated Multi-Item Lot Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 385-406, January.
  30. Kis, Tamás & Kovács, András, 2013. "Exact solution approaches for bilevel lot-sizing," European Journal of Operational Research, Elsevier, vol. 226(2), pages 237-245.
  31. N Rizk & A Martel & S D'Amours, 2008. "Synchronized production–distribution planning in a single-plant multi-destination network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 90-104, January.
  32. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
  33. 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.
  34. 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.
  35. Dogacan Yilmaz & İ. Esra Büyüktahtakın, 2023. "Learning Optimal Solutions via an LSTM-Optimization Framework," SN Operations Research Forum, Springer, vol. 4(2), pages 1-40, June.
  36. 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.
  37. BELVAUX, Gaetan & WOLSEY, Laurence A., 1998. "Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC-PROD," LIDAM Discussion Papers CORE 1998049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  38. Mocquillon, Cédric & Lenté, Christophe & T'Kindt, Vincent, 2011. "An efficient heuristic for medium-term planning in shampoo production," International Journal of Production Economics, Elsevier, vol. 129(1), pages 178-185, January.
  39. I. Karakayali & E. Akçalı & S. Çetinkaya & H. Üster, 2013. "Capacitated replenishment and disposal planning for multiple products with resalable returns," Annals of Operations Research, Springer, vol. 203(1), pages 325-350, March.
  40. Aghezzaf, El-Houssaine, 2000. "Lot-sizing problem with setup times in labor-based capacity production systems," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 1-9, March.
  41. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
  42. Lee, Younsoo & Lee, Kyungsik, 2023. "Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 310(1), pages 201-216.
  43. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-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.
  44. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
  45. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
  46. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
  47. Palak, Gökçe & Ekşioğlu, Sandra Duni & Geunes, Joseph, 2014. "Analyzing the impacts of carbon regulatory mechanisms on supplier and mode selection decisions: An application to a biofuel supply chain," International Journal of Production Economics, Elsevier, vol. 154(C), pages 198-216.
  48. Kolisch, R., 2000. "Integration of assembly and fabrication for make-to-order production," International Journal of Production Economics, Elsevier, vol. 68(3), pages 287-306, December.
  49. Haase, Knut, 1993. "Capacitated lot-sizing with linked production quantities of adjacent periods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 334, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  50. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
  51. Hugues Marchand & Laurence A. Wolsey, 2001. "Aggregation and Mixed Integer Rounding to Solve MIPs," Operations Research, INFORMS, vol. 49(3), pages 363-371, June.
  52. 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.
  53. Shi, Tie & Zhou, Xuesong, 2015. "A mixed integer programming model for optimizing multi-level operations process in railroad yards," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 19-39.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.