Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 959453, 12 pages
http://dx.doi.org/10.1155/2014/959453
Research Article

Mathematical Modeling and Optimal Blank Generation in Glass Manufacturing

1School of Computational and Applied Mathematics, University of the Witwatersrand, 1 Jan Smuts Avenue, Private Bag 03, WITS 2050, Johannesburg, South Africa
2TCSE, Faculty of Engineering and the Build Environment, University of the Witwatersrand, 1 Jan Smuts Avenue, Private Bag 03, WITS 2050, Johannesburg, South Africa

Received 6 January 2014; Accepted 20 January 2014; Published 27 April 2014

Academic Editor: Aderemi Oluyinka Adewumi

Copyright © 2014 Raymond Phillips 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. 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
  2. P. C. Gilmore and R. E. Gomory, “Multistage cutting stock problems of two and more dimensions,” Operations Research, vol. 13, no. 1, pp. 94–120, 1965. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. P. Sweeney and E. Paternoster, “Cutting and packing problems: a categorized, application-orientated research bibliography,” Journal of the Operational Research Society, vol. 43, no. 7, pp. 691–706, 1992. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. M. Hifi, “An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock,” Computers & Operations Research, vol. 24, no. 8, pp. 727–736, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. E. K. Burke, G. Kendall, and G. Whitwell, “A new placement heuristic for the orthogonal stock-cutting problem,” Operations Research, vol. 52, no. 4, pp. 655–671, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. M. L. Chambers and R. G. Dyson, “The cutting stock problem in the flat glass industry-selection of stock sizes,” Operational Research Quarterly, vol. 27, no. 4, pp. 949–957, 1976. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Reese, “Solution methods for the p-median problem: an annotated bibliography,” Networks, vol. 48, no. 3, pp. 125–142, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  8. N. Mladenović, J. Brimberg, P. Hansen, and J. A. Moreno-Pérez, “The p-median problem: a survey of metaheuristic approaches,” European Journal of Operational Research, vol. 179, no. 3, pp. 927–939, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, McGraw-Hill, 2nd edition, 2001. View at MathSciNet
  10. A. H. Land and A. G. Doig, “An automatic method of solving discrete programming problems,” Econometrica: Journal of the Econometric Society, vol. 28, pp. 497–520, 1960. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. M. A. Abramson, C. Audet, J. E. Dennis, Jr., and S. Le Digabel, “OrthoMADS: a deterministic MADS instance with orthogonal directions,” SIAM Journal on Optimization, vol. 20, no. 2, pp. 948–966, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. C. Audet and J. E. Dennis, Jr., “Mesh adaptive direct search algorithms for constrained optimization,” SIAM Journal on Optimization, vol. 17, no. 1, pp. 188–217, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. C. Audet and J. E. Dennis, Jr., “A progressive barrier for derivative-free nonlinear programming,” SIAM Journal on Optimization, vol. 20, no. 1, pp. 445–472, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. C. Audet, S. Le Digabel, and C. Tribes, “NOMAD user guide,” Tech. Rep. G-2009-37, Les cahiers du GERAD, 2009, http://www.gerad.ca/NOMAD/Downloads/user_guide.pdf. View at Publisher · View at Google Scholar
  15. S. Le Digabel, “Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm,” ACM Transactions on Mathematical Software, vol. 37, no. 4, pp. 1–15, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  16. M. A. Abramson, C. Audet, G. Couture, J. E. Dennis Jr., S. Le Digabel, and C. Tribes, “The NOMAD project,” http://www.gerad.ca/nomad.