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

A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

1School of Electrical Engineering & Automation, Tianjin Polytechnic University, Tianjin, China
2School of Management, Tianjin Polytechnic University, Tianjin, China
3Guangxi Colleges and University Key Laboratory of Minerals Engineering, Guangxi University, Guangxi, China

Received 29 December 2015; Revised 7 September 2016; Accepted 12 October 2016

Academic Editor: Yan-Jun Liu

Copyright © 2016 Huixin Tian 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. I. Ribas, R. Leisten, and J. M. Framiñan, “Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective,” Computers and Operations Research, vol. 37, no. 8, pp. 1439–1454, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. Z. H. Jin, K. Ohno, T. Ito, and S. E. Elmaghraby, “Scheduling hybrid flowshops in printed circuit board assembly lines,” Production and Operations Management, vol. 11, no. 2, pp. 216–230, 2002. View at Google Scholar · View at Scopus
  3. D. E. Deal, T. Yang, and S. Hallquist, “Job scheduling in petrochemical production: two-stage processing with finite intermediate storage,” Computers and Chemical Engineering, vol. 18, no. 4, pp. 333–344, 1994. View at Publisher · View at Google Scholar · View at Scopus
  4. X. W. Chen, J. G. Zhang, and Y. J. Liu, “Research on the intelligent control and simulation of automobile cruise system based on fuzzy system,” Mathematical Problems in Engineering, vol. 2016, Article ID 420308, 12 pages, 2016. View at Publisher · View at Google Scholar
  5. C. L. P. Chen, Y.-J. Liu, and G.-X. Wen, “Fuzzy neural network-based adaptive control for a class of uncertain nonlinear stochastic systems,” IEEE Transactions on Cybernetics, vol. 44, no. 5, pp. 583–593, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. Y.-J. Liu, J. Li, S. Tong, and C. L. Chen, “Neural network control-based adaptive learning design for nonlinear systems with full-state constraints,” IEEE Transactions on Neural Networks and Learning Systems, vol. 27, no. 7, pp. 1562–1571, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  7. Y.-J. Liu, Y. Gao, S. Tong, and Y. Li, “Fuzzy approximation-based adaptive backstepping optimal control for a class of nonlinear discrete-time systems with dead-zone,” IEEE Transactions on Fuzzy Systems, vol. 24, no. 1, pp. 16–28, 2016. View at Publisher · View at Google Scholar
  8. Y. J. Liu, S. C. Tong, D. J. Li, and Y. Gao, “Fuzzy adaptive control with state observer for a class of nonlinear discrete-time systems with input constraint,” IEEE Transactions on Fuzzy Systems, vol. 24, no. 5, pp. 1147–1158, 2016. View at Publisher · View at Google Scholar
  9. G. Y. Lai, Z. Liu, Y. Zhang, C. L. P. Chen, S. L. Xie, and Y. J. Liu, “Fuzzy adaptive inverse compensation method to tracking control of uncertain nonlinear systems with generalized actuator dead zone,” IEEE Transactions on Fuzzy Systems, 2016. View at Publisher · View at Google Scholar
  10. L. X. Tang and X. P. Wang, “A hybrid multi-objective evolutionary algorithm for multi-objective optimization problems,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 1, pp. 20–45, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. X. P. Wang and L. X. Tang, “An adaptive multi-population differential evolution algorithm for continuous multi-objective optimization,” Information Sciences, vol. 348, pp. 124–141, 2016. View at Publisher · View at Google Scholar
  12. F. Glover, “Tabu search and adaptive memory programming—advances, applications and challenges,” in Interfaces in Computer Science and Operations Research, R. S. Barr, R. V. Helgason, and J. L. Kennington, Eds., vol. 7 of Operations Research/Computer Science Interfaces Series, pp. 1–75, Kluwer Academic, 1997. View at Publisher · View at Google Scholar
  13. R. Linn and W. Zhang, “Hybrid flow shop scheduling: a survey,” Computers and Industrial Engineering, vol. 37, no. 1, pp. 57–61, 1999. View at Publisher · View at Google Scholar · View at Scopus
  14. R. Ruiz and J. A. Vazquez-Rodriguez, “The hybrid flow shop scheduling problem,” European Journal of Operational Research, vol. 205, no. 1, pp. 1–18, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. M. M. Dessouky, M. I. Dessouky, and S. K. Verma, “Flowshop scheduling with identical jobs and uniform parallel machines,” European Journal of Operational Research, vol. 109, no. 3, pp. 620–631, 1998. View at Publisher · View at Google Scholar · View at Scopus
  16. S. A. Brah and J. L. Hunsucker, “Branch and bound algorithm for the flow shop with multiple processors,” European Journal of Operational Research, vol. 51, no. 1, pp. 88–99, 1991. View at Publisher · View at Google Scholar · View at Scopus
  17. O. Moursli and Y. Pochet, “Branch-and-bound algorithm for the hybrid flowshop,” International Journal of Production Economics, vol. 64, no. 1, pp. 113–125, 2000. View at Publisher · View at Google Scholar · View at Scopus
  18. E. Néron, P. Baptiste, and J. N. D. Gupta, “Solving hybrid flow shop problem using energetic reasoning and global operations,” Omega, vol. 29, no. 6, pp. 501–511, 2001. View at Publisher · View at Google Scholar · View at Scopus
  19. S. A. Brah, “A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors,” Production Planning and Control, vol. 7, no. 4, pp. 362–373, 1996. View at Publisher · View at Google Scholar · View at Scopus
  20. A. G. P. Guinet and M. M. Solomon, “Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time,” International Journal of Production Research, vol. 34, no. 6, pp. 1643–1654, 1996. View at Publisher · View at Google Scholar · View at Scopus
  21. S. V. Sevastianov, “Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage,” Journal of Scheduling, vol. 5, no. 3, pp. 205–225, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. G. J. Kyparisis and C. Koulamas, “Flexible flow shop scheduling with uniform parallel machines,” European Journal of Operational Research, vol. 168, no. 3, pp. 985–997, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. V. Botta-Genoulaz, “Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness,” International Journal of Production Economics, vol. 64, no. 1, pp. 101–111, 2000. View at Publisher · View at Google Scholar · View at Scopus
  24. Y. Yang, S. Kreipl, and M. Pinedo, “Heuristics for minimizing total weighted tardiness in flexible flow shops,” Journal of Scheduling, vol. 3, no. 2, pp. 89–108, 2000. View at Publisher · View at Google Scholar · View at Scopus
  25. G.-C. Lee, J. M. Hong, and S.-H. Choi, “Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times,” Mathematical Problems in Engineering, vol. 2015, Article ID 420308, 10 pages, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. J. Grabowski and J. Pempera, “Sequencing of jobs in some production system,” European Journal of Operational Research, vol. 125, no. 3, pp. 535–550, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. T. J. Sawik, “Scheduling algorithm for flexible flow lines with limited intermediate buffers,” Applied Stochastic Models and Data Analysis, vol. 9, no. 2, pp. 127–138, 1993. View at Publisher · View at Google Scholar · View at Scopus
  28. B. Wardono and Y. Fathi, “A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities,” European Journal of Operational Research, vol. 155, no. 2, pp. 380–401, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. X. P. Wang and L. X. Tang, “A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers,” Computers & Operations Research, vol. 36, no. 3, pp. 907–918, 2009. View at Publisher · View at Google Scholar · View at Scopus
  30. Z. Cui and X. Gu, “A discrete group search optimizer for hybrid flowshop scheduling problem with random breakdown,” Mathematical Problems in Engineering, vol. 2014, Article ID 621393, 11 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  31. W. Xiao, P. Hao, S. Zhang, and X. Xu, “Hybrid flow shop scheduling using genetic algorithms,” in Proceedings of the 3th World Congress on Intelligent Control and Automation, pp. 537–541, IEEE Press, July 2000. View at Scopus
  32. M. E. Kurz and R. G. Askin, “Scheduling flexible flow lines with sequence-dependent setup times,” European Journal of Operational Research, vol. 159, no. 1, pp. 66–82, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. R. Ruiz and C. Maroto, “A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility,” European Journal of Operational Research, vol. 169, no. 3, pp. 781–800, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. Y. Zhang, S. Liu, and S. Sun, “Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations,” Mathematical Problems in Engineering, vol. 2014, Article ID 167073, 8 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. O. Engin and A. Döyen, “A new approach to solve hybrid flow shop scheduling problems by artificial immune system,” Future Generation Computer Systems, vol. 20, no. 6, pp. 1083–1095, 2004. View at Publisher · View at Google Scholar · View at Scopus
  36. L. Tang and X. Wang, “An improved particle swarm optimization algorithm for the hybrid flowshop scheduling to minimize total weighted completion time in process industry,” IEEE Transactions on Control Systems Technology, vol. 18, no. 6, pp. 1303–1314, 2010. View at Publisher · View at Google Scholar · View at Scopus
  37. K.-C. Ying and S.-W. Lin, “Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach,” International Journal of Production Research, vol. 44, no. 16, pp. 3161–3177, 2006. View at Publisher · View at Google Scholar · View at Scopus
  38. J. Behnamian, S. M. T. Fatemi Ghomi, and M. Zandieh, “A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic,” Expert Systems with Applications, vol. 36, no. 8, pp. 11057–11069, 2009. View at Publisher · View at Google Scholar · View at Scopus
  39. E. Rashidi, M. Jahandar, and M. Zandieh, “An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines,” International Journal of Advanced Manufacturing Technology, vol. 49, no. 9-12, pp. 1129–1139, 2010. View at Publisher · View at Google Scholar · View at Scopus
  40. S. H. Abyaneh and M. Zandieh, “Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers,” International Journal of Advanced Manufacturing Technology, vol. 58, no. 1–4, pp. 309–325, 2012. View at Publisher · View at Google Scholar · View at Scopus
  41. S. M. Mousavi, M. Mousakhani, and M. Zandieh, “Bi-objective hybrid flow shop scheduling: a new local search,” International Journal of Advanced Manufacturing Technology, vol. 64, no. 5–8, pp. 933–950, 2013. View at Publisher · View at Google Scholar · View at Scopus
  42. M. K. Marichelvam, T. Prabaharan, and X. S. Yang, “A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 2, pp. 301–305, 2014. View at Publisher · View at Google Scholar · View at Scopus
  43. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers < Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Publisher · View at Google Scholar · View at Scopus
  44. P. Hansen, N. Mladenović, and J. A. Moreno Pérez, “Variable neighbourhood search: methods and applications,” Annals of Operations Research, vol. 175, no. 1, pp. 367–407, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  45. W. M. Cheng, P. Guo, Z. Q. Zhang, M. Zeng, and J. Liang, “Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs,” Mathematical Problems in Engineering, vol. 2012, Article ID 928312, 20 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  46. X. Wang and L. Tang, “A population-based variable neighborhood search for the single machine total weighted tardiness problem,” Computers and Operations Research, vol. 36, no. 6, pp. 2105–2110, 2009. View at Publisher · View at Google Scholar · View at Scopus
  47. 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
  48. X. P. Wang and L. X. Tang, “A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem,” Computers & Operations Research, vol. 79, pp. 60–77, 2017. View at Publisher · View at Google Scholar
  49. M. Ciavotta, G. Minella, and R. Ruiz, “Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study,” European Journal of Operational Research, vol. 227, no. 2, pp. 301–313, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  50. A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P. N. Suganthan, and Q. Zhangd, “Multiobjective evolutionary algorithms: a survey of the state of the art,” Swarm and Evolutionary Computation, vol. 1, no. 1, pp. 32–49, 2011. View at Publisher · View at Google Scholar · View at Scopus
  51. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus