Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 4329613, 15 pages
http://dx.doi.org/10.1155/2016/4329613
Research Article

An Improved L-Shaped Method for Solving Process Flexibility Design Problems

1Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
2University of Alabama in Huntsville, Huntsville, AL 35899, USA
3Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China

Received 2 March 2016; Revised 17 July 2016; Accepted 21 July 2016

Academic Editor: Xiangyu Meng

Copyright © 2016 Huasheng Yang 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. E. M. Tachizawa and C. G. Thomsen, “Drivers and sources of supply flexibility: an exploratory study,” International Journal of Operations & Production Management, vol. 27, no. 10, pp. 1115–1136, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. H.-Y. Mak and Z.-J. M. Shen, “Stochastic programming approach to process flexibility design,” Flexible Services and Manufacturing Journal, vol. 21, no. 3-4, pp. 75–91, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Simchi-Levi and Y. Wei, “Understanding the performance of the long chain and sparse designs in process flexibility,” Operations Research, vol. 60, no. 5, pp. 1125–1141, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. Y. Zhang, S. Song, C. Wu, and W. Yin, “Variable exponential neighborhood search for the long chain design problem,” Neurocomputing, vol. 148, pp. 269–277, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Gerwin, “Manufacturing flexibility. A strategic perspective,” Management Science, vol. 39, no. 4, pp. 395–410, 1993. View at Publisher · View at Google Scholar · View at Scopus
  6. A. C. Garavelli, “Flexibility configurations for the supply chain management,” International Journal of Production Economics, vol. 85, no. 2, pp. 141–153, 2003. View at Publisher · View at Google Scholar · View at Scopus
  7. W. C. Jordan and S. C. Graves, “Principles on the benefits of manufacturing process flexibility,” Management Science, vol. 41, no. 4, pp. 577–594, 1995. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Schneider, J. Grahl, D. Francas, and D. Vigo, “A problem-adjusted genetic algorithm for flexibility design,” International Journal of Production Economics, vol. 141, no. 1, pp. 56–65, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. T. Deng and Z.-J. M. Shen, “Process flexibility design in unbalanced networks,” Manufacturing and Service Operations Management, vol. 15, no. 1, pp. 24–32, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Désir, V. Goyal, Y. Wei, and J. Zhang, “Sparse process flexibility designs: is the long chain really optimal?” Operations Research, vol. 64, no. 2, pp. 416–431, 2016. View at Publisher · View at Google Scholar
  11. M. C. Chou, G. A. Chua, and C.-P. Teo, “On range and response: dimensions of process flexibility,” European Journal of Operational Research, vol. 207, no. 2, pp. 711–724, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. B. Legros, O. Jouini, and Y. Dallery, “A flexible architecture for call centers with skill-based routing,” International Journal of Production Economics, vol. 159, pp. 192–207, 2015. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Sheikhzadeh, S. Benjaafar, and D. Gupta, “Machine sharing in manufacturing systems: total flexibility versus chaining,” International Journal of Flexible Manufacturing Systems, vol. 10, no. 4, pp. 351–378, 1998. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Gurumurthi and S. Benjaafar, “Modeling and analysis of flexible queueing systems,” Naval Research Logistics (NRL), vol. 51, no. 5, pp. 755–782, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. S. C. Graves and B. T. Tomlin, “Process flexibility in supply chains,” Management Science, vol. 49, no. 7, pp. 907–919, 2003. View at Google Scholar
  16. W. J. Hopp, S. M. R. Iravani, and W. L. Xu, “Vertical flexibility in supply chains,” Management Science, vol. 56, no. 3, pp. 495–502, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. Z. Aksin and F. Karaesmen, “Designing flexibility: characterizing the value of cross-training practices,” Working Paper, INSEAD, Fontainedbleau Cedex, France, 2002. View at Google Scholar
  18. W. J. Hopp and M. P. Van Oyen, “Agile workforce evaluation: a framework for cross-training and coordination,” IIE Transactions, vol. 36, no. 10, pp. 919–940, 2004. View at Publisher · View at Google Scholar · View at Scopus
  19. W. J. Hopp, E. Tekin, and M. P. Van Oyen, “Benefits of skill chaining in serial production lines with cross-trained workers,” Management Science, vol. 50, no. 1, pp. 83–98, 2004. View at Publisher · View at Google Scholar · View at Scopus
  20. R. B. Wallace and W. Whitt, “A staffing algorithm for call centers with skill-based routing,” Manufacturing & Service Operations Management, vol. 7, no. 4, pp. 276–294, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. S. M. Iravani, B. Kolfal, and M. P. Van Oyen, “Capability flexibility: a decision support methodology for parallel service and manufacturing systems with flexible servers,” IIE Transactions, vol. 43, no. 5, pp. 363–382, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. S. C. Graves, “Flexibility principles,” in Building Intuition, pp. 33–49, Springer, Berlin, Germany, 2008. View at Google Scholar
  23. M. C. Chou, G. A. Chua, C.-P. Teo, and H. Zheng, “Design for process flexibility: efficiency of the long chain and sparse structure,” Operations Research, vol. 58, no. 1, pp. 43–58, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. S. M. Iravani, M. P. Van Oyen, and K. T. Sims, “Structural flexibility: a new perspective on the design of manufacturing and service operations,” Management Science, vol. 51, no. 2, pp. 151–166, 2005. View at Publisher · View at Google Scholar · View at Scopus
  25. O. Z. AkşIn and F. Karaesmen, “Characterizing the performance of process flexibility structures,” Operations Research Letters, vol. 35, no. 4, pp. 477–484, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. M. C. Chou, G. A. Chua, C.-P. Teo, and H. Zheng, “Process flexibility revisited: the graph expander and its applications,” Operations Research, vol. 59, no. 5, pp. 1090–1105, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. D. Simchi-Levi and Y. Wei, “Worst-case analysis of process flexibility designs,” Operations Research, vol. 63, no. 1, pp. 166–185, 2015. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  28. X. Wang and J. Zhang, “Process flexibility: a distribution-free bound on the performance of k -chain,” Operations Research, vol. 63, no. 3, pp. 555–571, 2015. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  29. A. Ruszczyński, “Decomposition methods in stochastic programming,” Mathematical Programming, vol. 79, no. 1–3, pp. 333–353, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  30. F. You and I. E. Grossmann, “Multicut benders decomposition algorithm for process supply chain planning under uncertainty,” Annals of Operations Research, vol. 210, no. 1, pp. 191–211, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. R. M. Van Slyke and R. Wets, “L-shaped linear programs with applications to optimal control and stochastic programming,” SIAM Journal on Applied Mathematics, vol. 17, no. 4, pp. 638–663, 1969. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. T. W. Archibald, C. S. Buchanan, K. McKinnon, and L. C. Thomas, “Nested Benders decomposition and dynamic programming for reservoir optimisation,” Journal of the Operational Research Society, vol. 50, no. 5, pp. 468–479, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. C. H. Rosa and A. Ruszczyński, “On augmented lagrangian decomposition methods for multistage stochastic programs,” Annals of Operations Research, vol. 64, no. 1, pp. 289–309, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control, vol. 54, no. 1, pp. 48–61, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. J. L. Higle and S. Sen, “Stochastic decomposition: an algorithm for two-stage linear programs with recourse,” Mathematics of Operations Research, vol. 16, no. 3, pp. 650–669, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. S. Sen, Z. Zhou, and K. Huang, “Enhancements of two-stage stochastic decomposition,” Computers & Operations Research, vol. 36, no. 8, pp. 2434–2439, 2009. View at Publisher · View at Google Scholar · View at Scopus
  37. J. L. Higle and S. Sen, Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming, vol. 8, Springer Science & Business Media, 2013.
  38. L. Ntaimo, “Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse,” Operations Research, vol. 58, no. 1, pp. 229–243, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  39. B. Keller and G. Bayraksan, “Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints,” INFORMS Journal on Computing, vol. 24, no. 1, pp. 172–186, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  40. J. R. Birge and F. Louveaux, Introduction to Stochastic Programming, Springer Series in Operations Research and Financial Engineering, Springer, New York, NY, USA, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  41. J. R. Birge and F. V. Louveaux, “A multicut algorithm for two-stage stochastic linear programs,” European Journal of Operational Research, vol. 34, no. 3, pp. 384–392, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  42. C. Lei, W.-H. Lin, and L. Miao, “A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem,” European Journal of Operational Research, vol. 238, no. 3, pp. 699–710, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  43. S. Trukhanov, L. Ntaimo, and A. Schaefer, “Adaptive multicut aggregation for two-stage stochastic linear programs with recourse,” European Journal of Operational Research, vol. 206, no. 2, pp. 395–406, 2010. View at Publisher · View at Google Scholar · View at Scopus
  44. C. Wolf and A. Koberstein, “Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method,” European Journal of Operational Research, vol. 230, no. 1, pp. 143–156, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  45. Y. Song and J. Luedtke, “An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse,” SIAM Journal on Optimization, vol. 25, no. 3, pp. 1344–1367, 2015. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  46. V. Zverovich, C. I. Fábián, E. F. Ellison, and G. Mitra, “A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition,” Mathematical Programming Computation, vol. 4, no. 3, pp. 211–238, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. A. Ruszczyński, “A regularized decomposition method for minimizing a sum of polyhedral functions,” Mathematical Programming, vol. 35, no. 3, pp. 309–333, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  48. C. Lemaréchal, A. Nemirovskii, and Y. Nesterov, “New variants of bundle methods,” Mathematical Programming, vol. 69, no. 1–3, pp. 111–147, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  49. J. Linderoth and S. Wright, “Decomposition algorithms for stochastic programming on a computational grid,” Computational Optimization and Applications, vol. 24, no. 2-3, pp. 207–250, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  50. B. Keller and G. Bayraksan, “Scheduling jobs sharing multiple resources under uncertainty: a stochastic programming approach,” IIE Transactions, vol. 42, no. 1, pp. 16–30, 2009. View at Publisher · View at Google Scholar · View at Scopus
  51. T. L. Magnanti and R. T. Wong, “Accelerating Benders decomposition: algorithmic enhancement and model selection criteria,” Operations Research, vol. 29, no. 3, pp. 464–484, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  52. N. Papadakos, “Practical enhancements to the Magnanti-Wong method,” Operations Research Letters, vol. 36, no. 4, pp. 444–449, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  53. H. D. Sherali and B. J. Lunday, “On generating maximal nondominated Benders cuts,” Annals of Operations Research, vol. 210, no. 1, pp. 57–72, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  54. A. J. Kleywegt, A. Shapiro, and T. Homem-de-Mello, “The sample average approximation method for stochastic discrete optimization,” SIAM Journal on Optimization, vol. 12, no. 2, pp. 479–502, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  55. A. Ruszczynski and A. Shapiro, Stochastic Programming: Handbooks in Operations Research and Management Science, vol. 10, Elsevier, Amsterdam, The Netherlands, 2003.
  56. T. Santoso, S. Ahmed, M. Goetschalckx, and A. Shapiro, “A stochastic programming approach for supply chain network design under uncertainty,” European Journal of Operational Research, vol. 167, no. 1, pp. 96–115, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  57. F. Oliveira, I. E. Grossmann, and S. Hamacher, “Accelerating benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain,” Computers & Operations Research, vol. 49, pp. 47–58, 2014. View at Publisher · View at Google Scholar · View at Scopus
  58. E. Luis, I. S. Dolinskaya, and K. R. Smilowitz, “The stochastic generalized assignment problem with coordination constraints,” Working Paper, Department of Industrial Engineering and Management Sciences, Northwestern University, 2012. View at Google Scholar
  59. W. Rei, J.-F. Cordeau, M. Gendreau, and P. Soriano, “Accelerating benders decomposition by local branching,” INFORMS Journal on Computing, vol. 21, no. 2, pp. 333–345, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  60. C. I. Fábián and Z. Szőke, “Solving two-stage stochastic programming problems with level decomposition,” Computational Management Science, vol. 4, no. 4, pp. 313–353, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  61. J. R. Birge, C. J. Donohue, D. F. Holmes, and O. G. Svintsitski, “A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs,” Mathematical Programming, vol. 75, no. 2, pp. 327–352, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  62. M. Khatami, M. Mahootchi, and R. Z. Farahani, “Benders' decomposition for concurrent redesign of forward and closed-loop supply chain network with demand and return uncertainties,” Transportation Research Part E: Logistics and Transportation Review, vol. 79, pp. 1–21, 2015. View at Publisher · View at Google Scholar · View at Scopus