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

Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm

Industrial Engineering Department, Wuhan University of Science and Technology, Wuhan, Hubei 430081, China

Received 10 December 2015; Accepted 23 May 2016

Academic Editor: Anna M. Gil-Lafuente

Copyright © 2016 Zixiang 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. Y. K. Kim, Y. Kim, and Y. J. Kim, “Two-sided assembly line balancing: a genetic algorithm approach,” Production Planning & Control, vol. 11, no. 1, pp. 44–53, 2000. View at Publisher · View at Google Scholar · View at Scopus
  2. H. D. Purnomo, H.-M. Wee, and H. Rau, “Two-sided assembly lines balancing with assignment restrictions,” Mathematical and Computer Modelling, vol. 57, no. 1-2, pp. 189–199, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. A. Baykasoglu and T. Dereli, “Two-sided assembly line balancing using an ant-colony-based heuristic,” International Journal of Advanced Manufacturing Technology, vol. 36, no. 5-6, pp. 582–588, 2008. View at Publisher · View at Google Scholar · View at Scopus
  4. A. S. Simaria and P. M. Vilarinho, “2-ANTBAL: an ant colony optimisation algorithm for balancing two-sided assembly lines,” Computers & Industrial Engineering, vol. 56, no. 2, pp. 489–506, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. E. Falkenauer, “Line balancing in the real world,” in Proceedings of the International Conference on Product Lifecycle Management, vol. 1, pp. 360–370, 2005.
  6. Y. K. Kim, W. S. Song, and J. H. Kim, “A mathematical model and a genetic algorithm for two-sided assembly line balancing,” Computers and Operations Research, vol. 36, no. 3, pp. 853–865, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. H. D. Purnomo and H.-M. Wee, “Maximizing production rate and workload balancing in a two-sided assembly line using Harmony Search,” Computers and Industrial Engineering, vol. 76, no. 1, pp. 222–230, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. D. Lei and X. Guo, “Variable neighborhood search for the second type of two-sided assembly line balancing problem,” Computers & Operations Research, vol. 72, pp. 183–188, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  9. R. Ruiz and T. Stützle, “An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives,” European Journal of Operational Research, vol. 187, no. 3, pp. 1143–1159, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. Q.-K. Pan, L. Wang, and B.-H. Zhao, “An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion,” International Journal of Advanced Manufacturing Technology, vol. 38, no. 7-8, pp. 778–786, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. J. M. Framinan and R. Leisten, “Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm,” International Journal of Production Research, vol. 46, no. 22, pp. 6479–6498, 2008. View at Publisher · View at Google Scholar · View at Scopus
  12. I. Ribas, R. Companys, and X. Tort-Martorell, “An iterated greedy algorithm for the flowshop scheduling problem with blocking,” Omega, vol. 39, no. 3, pp. 293–301, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. G. Minella, R. Ruiz, and M. Ciavotta, “Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems,” Computers & Operations Research, vol. 38, no. 11, pp. 1521–1533, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. J. Bartholdi, “Balancing two-sided assembly lines: a case study,” International Journal of Production Research, vol. 31, no. 10, pp. 2447–2461, 1993. View at Publisher · View at Google Scholar · View at Scopus
  15. X.-F. Hu, E.-F. Wu, and Y. Jin, “A station-oriented enumerative algorithm for two-sided assembly line balancing,” European Journal of Operational Research, vol. 186, no. 1, pp. 435–440, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. E.-F. Wu, Y. Jin, J.-S. Bao, and X.-F. Hu, “A branch-and-bound algorithm for two-sided assembly line balancing,” International Journal of Advanced Manufacturing Technology, vol. 39, no. 9-10, pp. 1009–1015, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. X.-F. Hu, E.-F. Wu, J.-S. Bao, and Y. Jin, “A branch-and-bound algorithm to minimize the line length of a two-sided assembly line,” European Journal of Operational Research, vol. 206, no. 3, pp. 703–707, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. T. O. Lee, Y. Kim, and Y. K. Kim, “Two-sided assembly line balancing to maximize work relatedness and slackness,” Computers and Industrial Engineering, vol. 40, no. 3, pp. 273–292, 2001. View at Publisher · View at Google Scholar · View at Scopus
  19. S. D. Lapierre and A. B. Ruiz, “Balancing assembly lines: an industrial case study,” Journal of the Operational Research Society, vol. 55, no. 6, pp. 589–597, 2004. View at Publisher · View at Google Scholar · View at Scopus
  20. U. Özcan and B. Toklu, “A tabu search algorithm for two-sided assembly line balancing,” The International Journal of Advanced Manufacturing Technology, vol. 43, no. 7, pp. 822–829, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. L. Özbakir and P. Tapkan, “Bee colony intelligence in zone constrained two-sided assembly line balancing problem,” Expert Systems with Applications, vol. 38, no. 9, pp. 11947–11957, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Khorasanian, S. R. Hejazi, and G. Moslehi, “Two-sided assembly line balancing considering the relationships between tasks,” Computers & Industrial Engineering, vol. 66, no. 4, pp. 1096–1105, 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. U. Özcan and B. Toklu, “Balancing of mixed-model two-sided assembly lines,” Computers & Industrial Engineering, vol. 57, no. 1, pp. 217–227, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. U. Özcan, “Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm,” European Journal of Operational Research, vol. 205, no. 1, pp. 81–97, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. P. Chutima and P. Chimklai, “Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimisation with negative knowledge,” Computers and Industrial Engineering, vol. 62, no. 1, pp. 39–55, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. Y. Delice, E. K. Aydogan, U. Özcan, and M. S. İlkay, “A modified particle swarm optimization algorithm to mixed-model two-sided assembly line balancing,” Journal of Intelligent Manufacturing. In press. View at Publisher · View at Google Scholar
  27. B. Yuan, C.-Y. Zhang, X.-Y. Shao, and Z.-B. Jiang, “An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines,” Computers & Operations Research, vol. 53, pp. 32–41, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. Z. Yang, G. Zhang, and H. Zhu, “Multi-neighborhood based path relinking for two-sided assembly line balancing problem,” Journal of Combinatorial Optimization, pp. 1–20, 2015. View at Publisher · View at Google Scholar · View at Scopus
  29. Q. Tang, Z. Li, and L. Zhang, “An effective discrete artificial bee colony algorithm with idle time reduction techniques for two-sided assembly line balancing problem of type-II,” Computers & Industrial Engineering, vol. 97, pp. 146–156, 2016. View at Publisher · View at Google Scholar
  30. P. Tapkan, L. Ozbakir, and A. Baykasoglu, “Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms,” Applied Soft Computing Journal, vol. 12, no. 11, pp. 3343–3355, 2012. View at Publisher · View at Google Scholar · View at Scopus
  31. P. Tapkan, L. Ozbakir, and A. Baykasoglu, “Bees Algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem,” Optimization Letters, vol. 6, no. 6, pp. 1039–1049, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. B. Yuan, C.-Y. Zhang, and X.-Y. Shao, “A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints,” Journal of Intelligent Manufacturing, vol. 26, no. 1, pp. 159–168, 2013. View at Publisher · View at Google Scholar · View at Scopus
  33. B. Wang, Z. Guan, D. Li, C. Zhang, and L. Chen, “Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm,” International Journal of Advanced Manufacturing Technology, vol. 74, no. 5-8, pp. 791–805, 2014. View at Publisher · View at Google Scholar · View at Scopus
  34. D. Li, C. Zhang, X. Shao, and W. Lin, “A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints,” Journal of Intelligent Manufacturing, 2014. View at Publisher · View at Google Scholar · View at Scopus
  35. Q. Tang, Z. Li, L. Zhang, C. A. Floudas, and X. Cao, “Effective hybrid teaching-learning-based optimization algorithm for balancing two-sided assembly lines with multiple constraints,” Chinese Journal of Mechanical Engineering, vol. 28, no. 5, pp. 1067–1079, 2015. View at Publisher · View at Google Scholar · View at Scopus
  36. G. Tuncel and D. Aydin, “Two-sided assembly line balancing using teaching-learning based optimization algorithm,” Computers and Industrial Engineering, vol. 74, no. 1, pp. 291–299, 2014. View at Publisher · View at Google Scholar · View at Scopus
  37. W. B. Helgeson and D. P. Birnie, “Assembly line balancing using the ranked positional weight technique,” Journal of Industrial Engineering, vol. 12, pp. 394–397, 1961. View at Google Scholar
  38. R. Ruiz and T. Stützle, “A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem,” European Journal of Operational Research, vol. 177, no. 3, pp. 2033–2049, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  39. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  40. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, New York, NY, USA, 5th edition, 2000.
  41. M. Friedman, “The use of ranks to avoid the assumption of normality implicit in the analysis of variance,” Journal of the American Statistical Association, vol. 32, no. 200, pp. 675–701, 1937. View at Publisher · View at Google Scholar