Skip to main content

Carbon-Efficient Scheduling of Blocking Flow Shop by Hybrid Quantum-Inspired Evolution Algorithm

  • Conference paper
  • First Online:
Intelligent Computing Theories and Application (ICIC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10954))

Included in the following conference series:

Abstract

In this paper, a hybrid quantum-inspired evolution algorithm (HQEA) is proposed to solve the blocking flow shop scheduling problem (BFSP) with the objectives of makespan and carbon-efficient. First, depending on the characteristics of quantum, we provided a feasible coding and decoding method for HQEA. Then, a mechanism intended to update the quantum probability matrix. Meanwhile, new individuals are generated through the quantum probability matrix and have a specified probability of cataclysm. In addition, some local search operators are utilized to improve the non-dominated solutions. Finally, the effectiveness of HQEA in solving the BFSP is demonstrated by experiments and comparisons.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Merchan, A.F., Maravelias, C.T.: Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models. Comput. Chem. Eng. 84, 516–535 (2016)

    Article  Google Scholar 

  2. Gong, H., Tang, L., Duin, C.W.: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput. Oper. Res. 37(5), 960–969 (2010)

    Article  Google Scholar 

  3. Koren, Y., Wang, W., Gu, X.: Value creation through design for scalability of reconfigurable manufacturing systems. Int. J. Prod. Res. 55(5), 1227–1242 (2016)

    Article  Google Scholar 

  4. Fang, K., Uhan, N.A., Zhao, F., Sutherland, J.W.: Flow shop scheduling with peak power consumption constraints. Ann. Oper. Res. 206(1), 115–145 (2013)

    Article  MathSciNet  Google Scholar 

  5. Luo, H., Du, B., Huang, G.Q., Chen, H., Li, X.: Hybrid flow shop scheduling considering machine electricity consumption cost. Int. J. Prod. Econ. 146(2), 423–439 (2013)

    Article  Google Scholar 

  6. Liu, C.H., Huang, D.H.: Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms. Int. J. Prod. Res. 52(2), 337–352 (2014)

    Article  Google Scholar 

  7. Ding, J.Y., Song, S., Wu, C.: Carbon-efficient scheduling of flow shops by multi-objective optimization. Eur. J. Oper. Res. 248(3), 758–771 (2015)

    Article  MathSciNet  Google Scholar 

  8. Deng, J., Wang, L., Wu, C., Wang, J., Zheng, X.: A competitive memetic algorithm for carbon-efficient scheduling of distributed flow-shop. In: Huang, D.-S., Bevilacqua, V., Premaratne, P. (eds.) ICIC 2016. LNCS, vol. 9771, pp. 476–488. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42291-6_48

    Chapter  Google Scholar 

  9. Wang, L.: Advances in quantum-inspired evolutionary algorithms. Control Decis. 23(12), 1321–1326 (2008)

    MathSciNet  MATH  Google Scholar 

  10. Niu, Q., Zhou, T., Fei, M., Wang, B.: An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems. Math. Comput. Simul. 84(6), 1–25 (2012)

    Article  MathSciNet  Google Scholar 

  11. Latif, M.S., Zhou, H., Amir, M.: A hybrid Quantum Estimation of Distribution Algorithm (Q-EDA) for Flow-Shop Scheduling (2013)

    Google Scholar 

  12. Ma, Y., Tian, W.J., Fan, Y.Y.: Improved quantum ant colony algorithm for solving TSP problem. In: 2014 IEEE Workshop on Electronics, Computer and Applications, pp. 453–456. IEEE (2014)

    Google Scholar 

  13. Deng, G., Wei, M., Su, Q., Zhao, M.: An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem. Adv. Mech. Eng. 7(12) (2015)

    Article  Google Scholar 

  14. Singh, M.R., Mahapatra, S.S.: A Quantum Behaved Particle Swarm Optimization for Flexible Job Shop Scheduling. Pergamon Press Inc., Tarrytown (2016)

    Google Scholar 

  15. Wu, X., Wu, S.: An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem. J. Intell. Manuf. 28(6), 1441–1457 (2017)

    Article  Google Scholar 

  16. Fang, K., Uhan, N.A., Zhao, F., Sutherland, J.W.: Flow shop scheduling with peak power consumption constraints. Ann. Oper. Res. 206(1), 115–145 (2013)

    Article  MathSciNet  Google Scholar 

  17. Ding, J.Y., Song, S., Wu, C.: Carbon-efficient scheduling of flow shops by multi-objective optimization. Eur. J. Oper. Res. 248, 758–771 (2016)

    Article  MathSciNet  Google Scholar 

  18. Zhao, J. X., Qian, B., Hu, R., Zhang, C. S., & Li, Z. H.: An improved quantum-inspired evolution algorithm for no-wait flow shop scheduling problem to minimize makespan. In: International Conference on Intelligent Computing, pp. 536–547 (2016)

    Chapter  Google Scholar 

  19. Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2), 204–223 (2003)

    Article  Google Scholar 

  20. Mokhtari, H., Hasani, A.: An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput. Chem. Eng. 104, 339–352 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

This research is partially supported by the National Science Foundation of China (51665025), the Applied Basic Research Foundation of Yunnan Province (2015FB136), and the National Natural Science Fund for Distinguished Young Scholars of China (61525304).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bin Qian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yao, YJ., Qian, B., Hu, R., Wang, L., Xiang, FH. (2018). Carbon-Efficient Scheduling of Blocking Flow Shop by Hybrid Quantum-Inspired Evolution Algorithm. In: Huang, DS., Bevilacqua, V., Premaratne, P., Gupta, P. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10954. Springer, Cham. https://doi.org/10.1007/978-3-319-95930-6_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-95930-6_61

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-95929-0

  • Online ISBN: 978-3-319-95930-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics