Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2018 (2018), Article ID 1254794, 10 pages
https://doi.org/10.1155/2018/1254794
Research Article

Modeling of Throughput in Production Lines Using Response Surface Methodology and Artificial Neural Networks

Engineering Department, Autonomous University of Hidalgo State, Carr. Pachuca-Tulancingo, Col. Carboneras, 42184 Mineral de la Reforma, HGO, Mexico

Correspondence should be addressed to Joselito Medina-Marin

Received 5 November 2017; Accepted 21 December 2017; Published 31 January 2018

Academic Editor: Julio Blanco-Fernández

Copyright © 2018 Federico Nuñez-Piña 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. L. Demir, S. Tunali, and D. T. Eliiyi, “The state of the art on buffer allocation problem: A comprehensive survey,” Journal of Intelligent Manufacturing, vol. 25, no. 3, pp. 371–392, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. C. T. Papadopoulos, M. E. J. Okelly, and A. K. Tsadiras, “A DSS for the buffer allocation of production lines based on a comparative evaluation of a set of search algorithms,” International Journal of Production Research, vol. 51, no. 14, pp. 4175–4199, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. E. Koenigsberg, “Production lines and internal storage—A review,” Management Science, vol. 5, no. 4, pp. 410–433, 1959. View at Publisher · View at Google Scholar
  4. T. Park, “A two-phase heuristic algorithm for determining buffer sizes of production lines,” International Journal of Production Research, vol. 31, no. 3, pp. 613–631, 1993. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Seong, S. Y. Chang, and Y. Hong, “An algorithm for buffer allocation with linear resource constraints in a continuous-flow unreliable production line,” Asia-Pacific Journal of Operational Research, vol. 17, no. 2, pp. 169–180, 2000. View at Google Scholar · View at MathSciNet
  6. D. Seong, S. Y. Changs, and Y. Hongs, “Heuristic algorithms for buffer allocation in a production line with unreliable machines,” International Journal of Production Research, vol. 33, no. 7, pp. 1989–2005, 1995. View at Publisher · View at Google Scholar · View at Scopus
  7. S. B. Gershwin and J. E. Schor, “Efficient algorithms for buffer space allocation,” Annals of Operations Research, vol. 93, pp. 117–144, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. G. A. Vouros and H. T. Papadopoulos, “Buffer allocation in unreliable production lines using a knowledge based system,” Computers & Operations Research, vol. 25, no. 12, pp. 1055–1067, 1998. View at Publisher · View at Google Scholar · View at Scopus
  9. N. Nahas, D. Ait-Kadi, and M. Nourelfath, “A new approach for buffer allocation in unreliable production lines,” International Journal of Production Economics, vol. 103, no. 2, pp. 873–881, 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. H. K. Aksoy and S. M. Gupta, “Near optimal buffer allocation in remanufacturing systems with n-policy,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 496–508, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. L. Demir, S. Tunali, and D. T. Eliiyi, “An adaptive tabu search approach for buffer allocation problem in unreliable production lines,” in Proceedings of the 24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 2010, pp. 207–212, tur, June 2010. View at Scopus
  12. L. Demir, S. Tunali, and A. Lkketangen, “A tabu search approach for buffer allocation in production lines with unreliable machines,” Engineering Optimization, vol. 43, no. 2, pp. 213–231, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. L. Demir, S. Tunal, and D. T. Eliiyi, “An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines,” Computers & Operations Research, vol. 39, no. 7, pp. 1477–1486, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. D. D. Spinellis and C. T. Papadopoulos, “A simulated annealing approach for buffer allocation in reliable production lines,” Annals of Operations Research, vol. 93, pp. 373–384, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. M. Amiri and A. Mohtashami, “Buffer allocation in unreliable production lines based on design of experiments, simulation, and genetic algorithm,” The International Journal of Advanced Manufacturing Technology, vol. 62, no. 1-4, pp. 371–383, 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Nourelfath, N. Nahas, and D. Ait-Kadi, “Optimal design of series production lines with unreliable machines and finite buffers,” Journal of Quality in Maintenance Engineering, vol. 11, no. 2, pp. 121–138, 2005. View at Publisher · View at Google Scholar · View at Scopus
  17. L. Shi and S. Men, “Optimal buffer allocation in production lines,” Institute of Industrial Engineers (IIE). IIE Transactions, vol. 35, no. 1, pp. 1–10, 2003. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Dolgui, A. V. Eremeev, and V. S. Sigaev, “HBBA: Hybrid algorithm for buffer allocation in tandem production lines,” Journal of Intelligent Manufacturing, vol. 18, no. 3, pp. 411–420, 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. A. C. Diamantidis and C. T. Papadopoulos, “A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines,” Mathematical Problems in Engineering, no. 3, pp. 209–223, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. H. Yamashita and T. Altiok, “Buffer capacity allocation for a desired throughput in production lines,” Institute of Industrial Engineers (IIE). IIE Transactions, vol. 30, no. 10, pp. 883–891, 1998. View at Publisher · View at Google Scholar · View at Scopus
  21. F. Altiparmak, B. Dengiz, and A. A. Bulgak, “Buffer allocation and performance modeling in asynchronous assembly system operations: An artificial neural network metamodeling approach,” Applied Soft Computing, vol. 7, no. 3, pp. 946–956, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. B. Can and C. Heavey, “Comparison of experimental designs for simulation-based symbolic regression of manufacturing systems,” Computers & Industrial Engineering, vol. 61, no. 3, pp. 447–462, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. Y. Massim, F. Yalaoui, L. Amodeo, E. Chatelet, and A. Zeblah, “Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization,” Computers & Operations Research, vol. 37, no. 4, pp. 611–620, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. I. Sabuncuoglu, E. Erel, and Y. Gocgun, “Analysis of serial production lines: Characterisation study and a new heuristic procedure for optimal buffer allocation,” International Journal of Production Research, vol. 44, no. 13, pp. 2499–2523, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. I. Sabuncuoglu, E. Erel, and A. G. Kok, “Analysis of assembly systems for interdeparture time variability and throughput,” Institute of Industrial Engineers (IIE). IIE Transactions, vol. 34, no. 1, pp. 23–40, 2002. View at Publisher · View at Google Scholar · View at Scopus
  26. K.-C. Jeong and Y.-D. Kim, “Heuristics for selecting machines and determining buffer capacities in assembly systems,” Computers & Industrial Engineering, vol. 38, no. 3, pp. 341–360, 2000. View at Publisher · View at Google Scholar · View at Scopus
  27. B. Can and C. Heavey, “A comparison of genetic programming and artificial neural networks in metamodeling of discrete-event simulation models,” Computers & Operations Research, vol. 39, no. 2, pp. 424–436, 2012. View at Publisher · View at Google Scholar · View at Scopus
  28. T. McNamara, S. Hudson, and S. Shaaban, “Unpaced production lines with three simultaneous imbalance sources,” Industrial Management & Data Systems, vol. 111, no. 9, pp. 1356–1380, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. S. Helber, “Cash-flow-oriented buffer allocation in stochastic flow lines,” International Journal of Production Research, vol. 39, no. 14, pp. 3061–3083, 2001. View at Publisher · View at Google Scholar · View at Scopus
  30. J. M. Smith and F. R. B. Cruz, “The buffer allocation problem for general finite buffer queueing networks,” Institute of Industrial Engineers (IIE). IIE Transactions, vol. 37, no. 4, pp. 343–365, 2005. View at Publisher · View at Google Scholar · View at Scopus
  31. J. M. Smith, F. R. Cruz, and T. van Woensel, “Topological network design of general, finite, multi-server queueing networks,” European Journal of Operational Research, vol. 201, no. 2, pp. 427–441, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. H. Yamamoto, J. Abu Qudeiri, and E. Marui, “Definition of FTL with bypass lines and its simulator for buffer size decision,” International Journal of Production Economics, vol. 112, no. 1, pp. 18–25, 2008. View at Publisher · View at Google Scholar · View at Scopus
  33. F. S. Hillier and K. C. So, “The effect of machine breakdowns and interstage storage on the performance of production line systems,” International Journal of Production Research, vol. 29, no. 10, pp. 2043–2055, 1991. View at Publisher · View at Google Scholar · View at Scopus
  34. F. S. Hillier, K. C. So, and R. W. Boling, “Notes. Toward characterizing the optimal allocation of storage space in production line systems with variable processing times,” Management Science, vol. 39, no. 1, pp. 126–133, 1993. View at Publisher · View at Google Scholar · View at Scopus
  35. T. Gligorijevic, Z. Sevarac, B. Milovanovic et al., “Follow-up and risk assessment in patients with myocardial infarction using artificial neural networks,” Complexity, vol. 2017, Article ID 8953083, 8 pages, 2017. View at Google Scholar
  36. I. Pesko, V. Mucenski, M. Seslija et al., “Estimation of costs and durations of construction of urban roads using ann and svm,” Complexity, vol. 2017, Article ID 2450370, 13 pages, 2017. View at Google Scholar
  37. A. Tsadiras, C. Papadopoulos, and M. O'Kelly, “An artificial neural network based decision support system for solving the buffer allocation problem in reliable production lines,” Computers & Industrial Engineering, vol. 66, no. 4, pp. 1150–1162, 2013. View at Google Scholar
  38. A. I. Khuri and S. Mukhopadhyay, “Response surface methodology,” Wiley Interdisciplinary Reviews: Computational Statistics, vol. 2, no. 2, pp. 128–149, 2010. View at Publisher · View at Google Scholar
  39. A. T. Nair, A. R. Makwana, and M. M. Ahammed, “The use of response surface methodology for modelling and analysis of water and wastewater treatment processes: A review,” Water Science and Technology, vol. 69, no. 3, pp. 464–478, 2014. View at Publisher · View at Google Scholar · View at Scopus
  40. M. A. Bezerra, R. E. Santelli, E. P. Oliveira, L. S. Villar, and L. A. Escaleira, “Response surface methodology (RSM) as a tool for optimization in analytical chemistry,” Talanta, vol. 76, no. 5, pp. 965–977, 2008. View at Publisher · View at Google Scholar · View at Scopus
  41. S. F. Ding, H. Li, C. Y. Su, J. Z. Yu, and F. X. Jin, “Evolutionary artificial neural networks: a review,” Artificial Intelligence Review, vol. 39, no. 3, pp. 251–260, 2013. View at Publisher · View at Google Scholar · View at Scopus
  42. D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” Nature, vol. 323, no. 6088, pp. 533–536, 1986. View at Publisher · View at Google Scholar · View at Scopus
  43. M. Hagan and M. Menhaj, “Training feedforward networks with the Marquardt algorithm,” IEEE Transactions on Neural Networks and Learning Systems, vol. 5, no. 6, pp. 989–993, 1994. View at Publisher · View at Google Scholar · View at Scopus
  44. K. Levenberg, “A method for the solution of certain non-linear problems in least squares,” Quarterly of Applied Mathematics, vol. 2, pp. 164–168, 1944. View at Publisher · View at Google Scholar · View at MathSciNet
  45. D. Marquardt, “An algorithm for least-squares estimation of nonlinear parameters,” SIAM Journal on Applied Mathematics, vol. 11, no. 2, pp. 431–441, 1963. View at Publisher · View at Google Scholar · View at MathSciNet
  46. A. Likas and A. Stafylopatis, “Training the random neural network using quasi-Newton methods,” European Journal of Operational Research, vol. 126, no. 2, pp. 331–339, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. L. M. Saini and M. K. Soni, “Artificial neural network-based peak load forecasting using conjugate gradient methods,” IEEE Transactions on Power Systems, vol. 17, no. 3, pp. 907–912, 2002. View at Publisher · View at Google Scholar · View at Scopus
  48. M. F. Møller, “A scaled conjugate gradient algorithm for fast supervised learning,” Neural Networks, vol. 6, no. 4, pp. 525–533, 1993. View at Publisher · View at Google Scholar · View at Scopus
  49. L. M. Saini and M. K. Soni, “Artificial neural network based peak load forecasting using Levenberg-Marquardt and quasi-Newton methods,” IEE Proceedings Generation, Transmission and Distribution, vol. 149, no. 5, pp. 578–584, 2002. View at Publisher · View at Google Scholar · View at Scopus
  50. D. Wackerly, W. Mendenhall, and R. L. Scheaffer, Mathematical Statistics with Applications, Thomson/Brooks-Cole, USA, 2007.