Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 7209303, 18 pages
https://doi.org/10.1155/2017/7209303
Research Article

Fix-and-Optimize and Variable Neighborhood Search Approaches for Stochastic Multi-Item Capacitated Lot-Sizing Problems

1Department of Automation, Tsinghua University, Beijing 100084, China
2Department of Basic Science, Military Transportation University, Tianjin 300161, China

Correspondence should be addressed to Shiji Song; nc.ude.auhgnist.liam@sijihs

Received 19 October 2016; Revised 18 January 2017; Accepted 1 March 2017; Published 12 April 2017

Academic Editor: Honglei Xu

Copyright © 2017 Liuxi Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Haase, “Capacitated lot-sizing with sequence dependent setup costs,” OR Spektrum. Quantitative Approaches in Management, vol. 18, no. 1, pp. 51–59, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  2. K. Haase, “Capacitated lot-sizing with linked production quantities of adjacent periods,” in Beyond Manufacturing Resource Planning (MRP II), pp. 127–146, Springer, 1998. View at Google Scholar
  3. T. Wu, K. Akartunalı, J. Song, and L. Shi, “Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms,” Discrete Event Dynamic Systems, vol. 23, no. 2, pp. 211–239, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. A. F. Belo-Filho, F. M. B. Toledo, and B. Almada-Lobo, “Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover,” Journal of the Operational Research Society, vol. 65, no. 11, pp. 1735–1747, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. B. Karimi and S. M. T. Fatemi Ghomi, “A new heuristic for the CLSP problem with backlogging and set-up carryover,” International Journal of Advance Manufacturing Systems, vol. 5, no. 2, pp. 66–77, 2002. View at Google Scholar
  6. B. Karimi, S. M. T. F. Ghomi, and J. M. Wilson, “A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over,” Journal of the Operational Research Society, vol. 57, no. 2, pp. 140–147, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. D. Quadt and H. Kuhn, “Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over,” Naval Research Logistics, vol. 56, no. 4, pp. 366–384, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. C. R. Sox and Y. Gao, “The capacitated lot sizing problem with setup carry-over,” IIE Transactions, vol. 31, no. 2, pp. 173–181, 1999. View at Google Scholar · View at Scopus
  9. K. K. Haugen, A. Løkketangen, and D. L. Woodruff, “Progressive hedging as a meta-heuristic applied to stochastic lot-sizing,” European Journal of Operational Research, vol. 132, no. 1, pp. 116–122, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. P. Brandimarte, “Multi-item capacitated lot-sizing with demand uncertainty,” International Journal of Production Research, vol. 44, no. 15, pp. 2997–3022, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Beraldi, G. Ghiani, A. Grieco, and E. Guerriero, “Fix and relax heuristic for a stochastic lot-sizing problem,” Computational Optimization and Applications, vol. 33, no. 2-3, pp. 303–318, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Y. Guan, “Stochastic lot-sizing with backlogging: computational complexity analysis,” Journal of Global Optimization, vol. 49, no. 4, pp. 651–678, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. R. Ramezanian and M. Saidi-Mehrabad, “Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system,” Applied Mathematical Modelling, vol. 37, no. 7, pp. 5134–5147, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. R. Levi and C. Shi, “Approximation algorithms for the stochastic lot-sizing problem with order lead times,” Operations Research, vol. 61, no. 3, pp. 593–602, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. D. Mietzner and G. Reger, “Advantages and disadvantages of scenario approaches for strategic foresight,” International Journal of Technology Intelligence and Planning, vol. 1, no. 2, pp. 220–239, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. B. Karimi, S. M. T. Fatemi Ghomi, and J. M. Wilson, “The capacitated lot sizing problem: a review of models and algorithms,” Omega, vol. 31, no. 5, pp. 365–378, 2003. View at Publisher · View at Google Scholar · View at Scopus
  17. F. Sahling, L. Buschkühl, H. Tempelmeier, and S. Helber, “Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic,” Computers and Operations Research, vol. 36, no. 9, pp. 2546–2553, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. J. C. Lang and Z.-J. M. Shen, “Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions,” European Journal of Operational Research, vol. 214, no. 3, pp. 595–605, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. C. F. M. Toledo, M. da Silva Arantes, M. Y. B. Hossomi, P. M. França, and K. Akartunalı, “A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems,” Journal of Heuristics, vol. 21, no. 5, pp. 687–717, 2015. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Xiao, C. Zhang, L. Zheng, and J. N. D. Gupta, “MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem,” International Journal of Production Research, vol. 51, no. 16, pp. 5011–5028, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. P. Hansen and N. Mladenović, “Variable neighborhood search: principles and applications,” European Journal of Operational Research, vol. 130, no. 3, pp. 449–467, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. K. S. Hindi, K. Fleszar, and C. Charalambous, “An effective heuristic for the CLSP with set-up times,” Journal of the Operational Research Society, vol. 54, no. 5, pp. 490–498, 2003. View at Publisher · View at Google Scholar · View at Scopus
  23. Q. Zhao, C. Xie, and Y. Xiao, “A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems,” Electronic Notes in Discrete Mathematics, vol. 39, pp. 129–135, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. F. Seeanner, B. Almada-Lobo, and H. Meyr, “Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems,” Computers and Operations Research, vol. 40, no. 1, pp. 303–317, 2013. View at Publisher · View at Google Scholar · View at Scopus
  25. H. Chen, “Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems,” Omega, vol. 56, pp. 25–36, 2015. View at Publisher · View at Google Scholar
  26. G. D. Eppen and R. K. Martin, “Solving multi-item capacitated lot-sizing problems using variable redefinition,” Operations Research, vol. 35, no. 6, pp. 832–848, 1987. View at Publisher · View at Google Scholar · View at Scopus
  27. M. Caserta and S. Voß, “A MIP-based framework and its application on a lot sizing problem with setup carryover,” Journal of Heuristics, vol. 19, no. 2, pp. 295–316, 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. W. W. Trigeiro, L. J. Thomas, and J. O. McClain, “Capacitated lot sizing with setup times,” Management Science, vol. 35, no. 3, pp. 353–366, 1989. View at Publisher · View at Google Scholar
  29. S. Helber, F. Sahling, and K. Schimmelpfeng, “Dynamic capacitated lot sizing with random demand and dynamic safety stocks,” OR Spectrum. Quantitative Approaches in Management, vol. 35, no. 1, pp. 75–105, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM Computing Surveys, vol. 31, no. 3, pp. 264–323, 1999. View at Publisher · View at Google Scholar · View at Scopus