Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 3064724, 13 pages
https://doi.org/10.1155/2017/3064724
Research Article

A Hybrid Quantum Evolutionary Algorithm with Improved Decoding Scheme for a Robotic Flow Shop Scheduling Problem

1School of Management, Xi’an University of Science and Technology, Xi’an 710054, China
2Université Bourgogne Franche-Comté, UTBM, OPERA, 90100 Belfort, France

Correspondence should be addressed to Weidong Lei; nc.ude.tsux@gnodiewiel

Received 8 October 2016; Accepted 28 February 2017; Published 16 April 2017

Academic Editor: Calogero Orlando

Copyright © 2017 Weidong Lei 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. Q. Zhang, H. Manier, M.-A. Manier, and C. Bloch, “Heuristics for predictive hoist scheduling problems,” European Journal of Industrial Engineering, vol. 8, no. 5, pp. 695–715, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. H. Chen, C. Chu, and J.-M. Proth, “Cyclic scheduling of a hoist with time window constraints,” IEEE Transactions on Robotics and Automation, vol. 14, no. 1, pp. 144–152, 1998. View at Publisher · View at Google Scholar · View at Scopus
  3. M.-A. Manier and C. Bloch, “A classification for hoist scheduling problems,” International Journal of Flexible Manufacturing Systems, vol. 15, no. 1, pp. 37–55, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. P. Yan, A. Che, X. Cai, and X. Tang, “Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance,” Computers and Operations Research, vol. 50, pp. 128–140, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. J. Feng, A. Che, and N. Wang, “Bi-objective cyclic scheduling in a robotic cell with processing time windows and non-Euclidean travel times,” International Journal of Production Research, vol. 52, no. 9, pp. 2505–2518, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Lei and T. Wang, “A proof: the cyclic hoist scheduling problem is NP-complete,” Working Paper, Rutgers University, 1989. View at Google Scholar
  7. L. W. Phillips and P. S. Unger, “Mathematical programming solution of a hoist scheduling program,” AIIE Transactions, vol. 8, no. 2, pp. 219–225, 1976. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Che, J. Feng, H. Chen, and C. Chu, “Robust optimization for the cyclic hoist scheduling problem,” European Journal of Operational Research, vol. 240, no. 3, pp. 627–636, 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. L. Lei and T. J. Wang, “Determining optimal cyclic hoist schedules in a single-hoist electroplating line,” IIE Transactions, vol. 26, no. 2, pp. 25–33, 1994. View at Publisher · View at Google Scholar · View at Scopus
  10. P. Yan, A. Che, N. Yang, and C. Chu, “A tabu search algorithm with solution space partition and repairing procedure for cyclic robotic cell scheduling problem,” International Journal of Production Research, vol. 50, no. 22, pp. 6403–6418, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Liu, Y. Jiang, and Z. Zhou, “Cyclic sduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution,” IIE Transactions, vol. 34, no. 10, pp. 905–914, 2002. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Che and C. Chu, “Cyclic hoist scheduling in large real-life electroplating lines,” OR Spectrum, vol. 29, no. 3, pp. 445–470, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. L. Lei and T. Wang, “The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints,” Management Science, vol. 37, no. 12, pp. 1629–1638, 1991. View at Google Scholar
  14. Z. Zhou and J. Liu, “A heuristic algorithm for the two-hoist cyclic scheduling problem with overlapping hoist coverage ranges,” IIE Transactions, vol. 40, no. 8, pp. 782–794, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. M.-A. Manier, C. Varnier, and P. Baptiste, “Constraint-based model for the cyclic multi-hoists scheduling problem,” Production Planning and Control, vol. 11, no. 3, pp. 244–257, 2000. View at Publisher · View at Google Scholar · View at Scopus
  16. M.-A. Manier and S. Lamrous, “An evolutionary approach for the design and scheduling of electroplating facilities,” Journal of Mathematical Modelling and Algorithms, vol. 7, no. 2, pp. 197–215, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. A. Che and C. Chu, “Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach,” International Journal of Production Research, vol. 42, no. 12, pp. 2435–2456, 2004. View at Publisher · View at Google Scholar · View at Scopus
  18. J. M. Y. Leung, G. Zhang, X. Yang, R. Mak, and K. Lam, “Optimal cyclic multi-hoist scheduling: a mixed integer programming approach,” Operations Research, vol. 52, no. 6, pp. 965–976, 2004. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Elmi and S. Topaloglu, “Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots,” International Journal of Computer Integrated Manufacturing, pp. 1–17, 2016. View at Publisher · View at Google Scholar · View at Scopus
  20. A. El Amraoui, M.-A. Manier, A. El Moudni, and M. Benrejeb, “A mixed linear program for a multi-part cyclic hoist scheduling problem,” International Journal of Science and Techniques of Automatic Control & Computer Engineering, vol. 11, pp. 612–623, 2008. View at Google Scholar
  21. J. Feng, A. Che, and C. Chu, “Dynamic hoist scheduling problem with multi-capacity reentrant machines: a mixed integer programming approach,” Computers and Industrial Engineering, vol. 87, article 4074, pp. 611–620, 2015. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Che, Z. Zhou, C. Chu, and H. Chen, “Multi-degree cyclic hoist scheduling with time window constraints,” International Journal of Production Research, vol. 49, no. 19, pp. 5679–5693, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Elmi and S. Topaloglu, “Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization,” Computers and Operations Research, vol. 73, pp. 67–83, 2016. View at Publisher · View at Google Scholar · View at Scopus
  24. X. Li and R. Y. K. Fung, “A Mixed integer linear programming solution for single hoist Multi-degree cyclic scheduling with reentrance,” Engineering Optimization, vol. 46, no. 5, pp. 704–723, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. D. Deutsch, “Quantum theory, the Church-Turing principle and the universal quantum computer,” Proceedings of the Royal Society. London. Series A, vol. 400, no. 1818, pp. 97–117, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  26. A. Narayanan and M. Moore, “Quantum-inspired genetic algorithms,” in Proceedings of the IEEE International Conference on Evolutionary Computation, p. 6166, Nagoya, Japan, May 1996.
  27. K.-H. Han and J.-H. Kim, “Quantum-inspired evolutionary algorithm for a class of combinatorial optimization,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 6, pp. 580–593, 2002. View at Publisher · View at Google Scholar · View at Scopus
  28. T.-C. Lu and G.-R. Yu, “An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems,” Information Sciences, vol. 243, pp. 39–56, 2013. View at Publisher · View at Google Scholar · View at Scopus
  29. A. Che, P. Wu, F. Chu, and M. Zhou, “Improved quantum-inspired evolutionary algorithm for large-size lane reservation,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 45, no. 12, pp. 1535–1548, 2015. View at Publisher · View at Google Scholar · View at Scopus
  30. B.-B. Li and L. Wang, “A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 37, no. 3, pp. 576–591, 2007. View at Publisher · View at Google Scholar · View at Scopus
  31. T. Zheng and M. Yamashiro, “Solving flow shop scheduling problems by quantum differential evolutionary algorithm,” International Journal of Advanced Manufacturing Technology, vol. 49, no. 5, pp. 643–662, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. J. Gu, X. Gu, and M. Gu, “A novel parallel quantum genetic algorithm for stochastic job shop scheduling,” Journal of Mathematical Analysis and Applications, vol. 355, no. 1, pp. 63–81, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. J. Gu, M. Gu, C. Cao, and X. Gu, “A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem,” Computers and Operations Research, vol. 37, no. 5, pp. 927–937, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. K.-H. Han and J.-H. Kim, “Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two-phase scheme,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 2, pp. 156–169, 2004. View at Publisher · View at Google Scholar · View at Scopus
  35. S. Akpınar and G. Mirac Bayhan, “A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints,” Engineering Applications of Artificial Intelligence, vol. 24, no. 3, pp. 449–457, 2011. View at Publisher · View at Google Scholar · View at Scopus
  36. M. Srinivas and L. M. Patnaik, “Adaptive probabilities of crossover and mutation in genetic algorithms,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 24, no. 4, pp. 656–667, 1994. View at Publisher · View at Google Scholar · View at Scopus
  37. P. Yan, G. Wang, A. Che, and Y. Li, “Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance,” Computers and Operations Research, vol. 76, pp. 155–166, 2016. View at Publisher · View at Google Scholar · View at Scopus
  38. M.-A. Manier, Contribution à l'ordonnancement cyclique du système de manutention d'une ligne de galvanoplastie [PhD thesis in Automatics and Computer Science], Université de Franche-Comté, Besançon, France, 1994.
  39. Z. Zhou, A. Che, and P. Yan, “A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints,” Applied Mathematical Modelling, vol. 36, no. 8, pp. 3621–3629, 2012. View at Publisher · View at Google Scholar · View at MathSciNet