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

Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

Citations

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


Cited by:

  1. 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).
  2. Cunha, Jesus O. & Melo, Rafael A., 2021. "Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 874-892.
  3. 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.
  4. 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.
  5. Wolsey, Laurence A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 154-165, May.
  6. 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.
  7. Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
  8. VAN VYVE, Mathieu & WOLSEY, Laurence & YAMAN, Hande, 2012. "Relaxations for two-level multi-item lot-sizing problem," LIDAM Discussion Papers CORE 2012031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  9. Chiu, Singa Wang & Wu, Cheng-Sian & Tseng, Chao-Tang, 2019. "Incorporating an expedited rate, rework, and a multi-shipment policy into a multi-item stock refilling system," Operations Research Perspectives, Elsevier, vol. 6(C).
  10. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
  11. 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.
  12. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
  13. N.C. Simpson & S. Selcuk Erenguc, 2005. "Modeling multiple stage manufacturing systems with generalized costs and capacity issues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 560-570, September.
  14. Li, Yuchen & Saldanha-da-Gama, Francisco & Liu, Ming & Yang, Zaoli, 2023. "A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 304(1), pages 353-365.
  15. Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
  16. 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).
  17. 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.
  18. 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.
  19. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
  20. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  21. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  22. Kimms, Alf & Drexl, Andreas, 1996. "Multi-level lot sizing: A literature survey," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 405, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  23. 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.
  24. 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.
  25. 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.
  26. Nadjib Brahimi & Tarik Aouam, 2016. "Multi-item production routing problem with backordering: a MILP approach," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1076-1093, February.
  27. VAN VYVE, Mathieu & POCHET, Yves, 2001. "A general heuristic or production planning problems," LIDAM Discussion Papers CORE 2001056, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  28. 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.
  29. Haase, Knut & Kimms, Alf, 1996. "Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 393, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  30. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
  31. Stadtler, Hartmut, 1996. "Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing," European Journal of Operational Research, Elsevier, vol. 94(3), pages 561-581, November.
  32. 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.
  33. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.
  34. 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.
  35. Zhang, Guoqing & Nishi, Tatsushi & Turner, Sarina D.O. & Oga, Keisuke & Li, Xindan, 2017. "An integrated strategy for a production planning and warehouse layout problem: Modeling and solution approaches," Omega, Elsevier, vol. 68(C), pages 85-94.
  36. Tao Wu, 2022. "Predictive Search for Capacitated Multi-Item Lot Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 385-406, January.
  37. 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.
  38. Chiu, Yuan-Shyi Peter & Chiu, Victoria & Lin, Hong-Dar & Chang, Huei-Hsin, 2019. "Meeting multiproduct demand with a hybrid inventory replenishment system featuring quality reassurance," Operations Research Perspectives, Elsevier, vol. 6(C).
  39. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
  40. 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.
  41. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt9gx170tx, University of California Transportation Center.
  42. Kumar Rajaram & Uday S. Karmarkar, 2002. "Product Cycling With Uncertain Yields: Analysis and Application to the Process Industry," Operations Research, INFORMS, vol. 50(4), pages 680-691, August.
  43. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.