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

Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial-Use Paper Production

Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan

Received 29 November 2013; Accepted 25 May 2014; Published 17 June 2014

Academic Editor: Hsiao-Fan Wang

Copyright © 2014 Fu-Kwun Wang and Feng-Tai Liu. 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. H. Stadtler, “A one-dimensional cutting stock problem in the aluminium industry and its solution,” European Journal of Operational Research, vol. 44, no. 2, pp. 209–223, 1990. View at Google Scholar · View at Scopus
  2. M. Gradǐsar, J. Jesenko, and G. Resinovič, “Optimization of roll cutting in clothing industry,” Computers and Operations Research, vol. 24, no. 10, pp. 945–953, 1997. View at Google Scholar · View at Scopus
  3. L. O. Morgan, A. R. Morton, and R. L. Daniels, “Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets,” European Journal of Operational Research, vol. 172, no. 3, pp. 747–760, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. G. Wäscher, H. Haußner, and H. Schumann, “An improved typology of cutting and packing problems,” European Journal of Operational Research, vol. 183, no. 3, pp. 1109–1130, 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Dikili, A. Takinaci, and N. Pek, “A new heuristic approach to one-dimensional stock-cutting problems with multiple stock lengths in ship production,” Ocean Engineering, vol. 35, no. 7, pp. 637–645, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Abuabara and R. Morabito, “Cutting optimization of structural tubes to build agricultural light aircrafts,” Annals of Operations Research, vol. 169, no. 1, pp. 149–165, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. M. Gradišar, G. Resinovič, and M. Kljajić, “Evaluation of algorithms for one-dimensional cutting,” Computers & Operations Research, vol. 29, no. 9, pp. 1207–1220, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting-stock problem,” Operations Research, vol. 9, no. 6, pp. 849–859, 1961. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting stock problem, part II,” Operations Research, vol. 11, no. 3, pp. 863–888, 1963. View at Google Scholar
  10. W. Gochet and M. Vandebroek, “A dynamic programming based heuristic for industrial buying of cardboard,” European Journal of Operational Research, vol. 38, no. 1, pp. 104–112, 1989. View at Google Scholar · View at Scopus
  11. C. H. Daǧli, “Knowledge-based systems for cutting stock problems,” European Journal of Operational Research, vol. 44, no. 2, pp. 160–166, 1990. View at Google Scholar · View at Scopus
  12. H. Foerster and G. Wäscher, “Simulated annealing for order spread minimization in sequencing cutting patterns,” European Journal of Operational Research, vol. 110, no. 2, pp. 272–281, 1998. View at Google Scholar · View at Scopus
  13. P. H. Vance, “Branch-and-price algorithms for the one-dimensional cutting stock problem,” Computational Optimization and Applications, vol. 9, no. 3, pp. 211–228, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. M. Gradišar, M. Kljajić, G. Resinovič, and J. Jesenko, “A sequential heuristic procedure for one-dimensional cutting,” European Journal of Operational Research, vol. 114, no. 3, pp. 557–568, 1999. View at Google Scholar · View at Scopus
  15. M. Sakawa, I. Nishizaki, and M. Hitaka, “Interactive fuzzy programming for multi-level 0-1 programming problems through genetic algorithms,” European Journal of Operational Research, vol. 114, no. 3, pp. 580–588, 1999. View at Publisher · View at Google Scholar · View at Scopus
  16. S. M. A. Suliman, “Pattern generating procedure for the cutting stock problem,” International Journal of Production Economics, vol. 74, no. 1–3, pp. 293–301, 2001. View at Publisher · View at Google Scholar · View at Scopus
  17. H. B. Amor, J. Desrosiers, and J. M. Valério de Carvalho, “Dual-optimal inequalities for stabilized column generation,” Operations Research, vol. 54, no. 3, pp. 454–463, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. P. Trkman and M. Gradisar, “One-dimensional cutting stock optimization in consecutive time periods,” European Journal of Operational Research, vol. 179, no. 2, pp. 291–301, 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. W.-C. Weng and T.-C. Sung, “Optimization of a line-cutting procedure for ship hull construction by an effective tabu search,” International Journal of Production Research, vol. 46, no. 21, pp. 5935–5949, 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Alves and J. M. Valério de Carvalho, “Accelerating column generation for variable sized bin-packing problems,” European Journal of Operational Research, vol. 183, no. 3, pp. 1333–1352, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. S. L. Nonås and A. Thorstenson, “Solving a combined cutting-stock and lot-sizing problem with a column generating procedure,” Computers and Operations Research, vol. 35, no. 10, pp. 3371–3392, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. H. Reinersten and T. W. M. Vossen, “The one-dimensional cutting stock problem with due dates,” European Journal of Operational Research, vol. 201, no. 3, pp. 701–711, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  23. K. Matsumoto, S. Umetani, and H. Nagamochi, “On the one-dimensional stock cutting problem in the paper tube industry,” Journal of Scheduling, vol. 14, no. 3, pp. 281–290, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. J. Erjavec, M. Gradisar, and P. Trkman, “Assessment of stock size to minimize cutting stock production costs,” International Journal of Production Economics, vol. 135, no. 1, pp. 170–176, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. M. H. M. A. Jahromi, R. Tavakkoli-Moghaddam, A. Makui, and A. Shamsi, “Solving an one-dimensional cutting stock problem by simulated annealing and tabu search,” Journal of Industrial Engineering International, vol. 8, no. 1, pp. 24–31, 2012. View at Google Scholar
  26. A. Mobasher and A. Ekici, “Solution approaches for the cutting stock problem with setup cost,” Computers & Operations Research, vol. 40, no. 1, pp. 225–235, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  27. G. C. Wang, C. P. Li, J. Lv, X. X. Zhao, and H. Y. Cuo, “An efficient algorithm design for the one-dimensional cutting-stock problem,” Advanced Materials Research, vol. 602–604, pp. 1753–1756, 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. H. H. Yanasse, “A review of three decades of research on some combinatorial optimization problems,” Pesquisa Operacional, vol. 33, no. 1, pp. 11–36, 2013. View at Publisher · View at Google Scholar · View at Scopus
  29. L. Kos and J. Duhovnik, “Cutting optimization with variable-sized stock and inventory status data,” International Journal of Production Research, vol. 40, no. 10, pp. 2289–2301, 2002. View at Publisher · View at Google Scholar · View at Scopus
  30. S. Dimitriadis and E. Kehris, “Cutting stock optimization in custom door and window manufacturing industry,” International Journal of Decision Sciences, Risk and Management, vol. 1, no. 1, pp. 66–80, 2009. View at Google Scholar
  31. A. C. Cherri, M. N. Arenales, and H. H. Yanasse, “The one-dimensional cutting stock problem with usable leftover—a heuristic approach,” European Journal of Operational Research, vol. 196, no. 3, pp. 897–908, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. K. C. Poldi and M. N. Arenales, “Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths,” Computers and Operations Research, vol. 36, no. 6, pp. 2074–2081, 2009. View at Publisher · View at Google Scholar · View at Scopus
  33. Y. Cui and Y. Yang, “A heuristic for the one-dimensional cutting stock problem with usable leftover,” European Journal of Operational Research, vol. 204, no. 2, pp. 245–250, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. S. A. Araujo, A. A. Constantino, and K. C. Poldi, “An evolutionary algorithm for the one-dimensional cutting stock problem,” International Transactions in Operational Research, vol. 18, no. 1, pp. 115–127, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  35. A. C. Cherri, M. N. Arenales, and H. H. Yanasse, “The usable leftover one-dimensional cutting stock problem—a priority-in-use heuristic,” International Transactions in Operational Research, vol. 20, no. 2, pp. 189–199, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. F. K. Wang and F. T. Liu, “A new decision model for reducing trim loss and inventory in the paper industry,” Journal of Applied Mathematics, vol. 2014, Article ID 987054, 10 pages, 2014. View at Publisher · View at Google Scholar
  37. Lingo Software, Version 11, Lindo Systems, Inc, Chicago, Ill, USA, 2009.