Skip to main content
SpringerLink
Log in

A Multi-objective Iterated Local Search Heuristic for Energy-Efficient No-Wait Permutation Flowshop Scheduling Problem

  • Conference paper
  • First Online:
Intelligent Systems Design and Applications (ISDA 2022)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 717))

  • 216 Accesses

Abstract

This paper addresses a multi-objective no-wait permutation Flowshop scheduling problem. In this problem, a job must be processed, from start to finish, without any interruption between machines. The jobs have processing times that are influenced by a speed factor inversely proportional to the energy consumption of the machines. The objective of the problem is to determine the job sequencing and the speed level to execute them, in such a way that two objectives are simultaneously minimized: the total energy consumption of the machines and the total tardiness in relation to the due dates of the jobs. Motivated by the computational complexity of the problem, a multi-objective heuristic based on the Iterated Local Search (ILS) meta-heuristic is proposed. To test the efficiency of the ILS heuristic, a set of 110 instances from the literature is used. The performance of the proposed heuristic is evaluated by comparing it with results from other heuristics available in the literature.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.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. Mansouri, S.A., Aktas, E., Besikci, U.: Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption. Eur. J. Oper. Res. 248(3), 772–788 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Mouzon, G., Yildirim, M.B.: A framework to minimise total energy consumption and total tardiness on a single machine. Int. J. Sustain. Eng. 1(2), 105–116 (2008)

    Article  Google Scholar 

  3. Nawaz, M., Enscore, E.E., Jr., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)

    Article  Google Scholar 

  4. Öztop, H., Fatih Tasgetiren, M., Türsel Eliiyi, D., Pan, Q.-K.: Green permutation flowshop scheduling: a trade- off- between energy consumption and total flow time. In: Huang, D.-S., Gromiha, M.M., Han, K., Hussain, A. (eds.) ICIC 2018. LNCS (LNAI), vol. 10956, pp. 753–759. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-95957-3_79

    Chapter  Google Scholar 

  5. Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9), 2807–2839 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ramezanian, R., Vali-Siar, M.M., Jalalian, M.: Green permutation flowshop scheduling problem with sequence-dependent setup times: a case study. Int. J. Prod. Res. 57(10), 3311–3333 (2019)

    Article  Google Scholar 

  7. Sapkal, S.U., Laha, D.: A heuristic for no-wait flow shop scheduling. Int. J. Adv. Manuf. Technol. 68(5), 1327–1338 (2013)

    Google Scholar 

  8. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)

    Google Scholar 

  9. Tasgetiren, M.F., Yüksel, D., Gao, L., Pan, Q.K., Li, P.: A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem. Procedia Manuf. 39, 1223–1231 (2019)

    Article  Google Scholar 

  10. Tseng, L.Y., Lin, Y.T.: A hybrid genetic algorithm for no-wait flowshop scheduling problem. Int. J. Prod. Econ. 128(1), 144–152 (2010)

    Article  MathSciNet  Google Scholar 

  11. Yüksel, D., Taşgetiren, M.F., Kandiller, L., Gao, L.: An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption. Comput. Ind. Eng. 145, 106,431 (2020)

    Google Scholar 

  12. Yüksel, D., Taşgetiren, M.F., Kandiller, L., Pan, Q.K.: Metaheuristics for energy-efficient no-wait flowshops: a trade-off between makespan and total energy consumption. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2020)

    Google Scholar 

Download references

Acknowledgments

This work was supported by CAPES and CNPq.

Author information

Authors and Affiliations

  1. Department of Computer Science, Universidade Federal de Viçosa, Viçosa, MG, 36570-900, Brazil

    Gabriel de Paula Félix, José Elias C. Arroyo & Matheus de Freitas Araujo

Authors
  1. Gabriel de Paula Félix
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Elias C. Arroyo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matheus de Freitas Araujo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matheus de Freitas Araujo .

Editor information

Editors and Affiliations

  1. Faculty of Computing and Data Science, FLAME University, Pune, Maharashtra, India

    Ajith Abraham

  2. Center for Smart Computing Continuum, Burgenland, Austria

    Sabri Pllana

  3. University of Bari, Bari, Italy

    Gabriella Casalino

  4. University of Jinan, Jinan, Shandong, China

    Kun Ma

  5. Department of Computer Science and Engineering, Thapar Institute of Engineering and Technology, Patiala, Punjab, India

    Anu Bajaj

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

de Paula Félix, G., Arroyo, J.E.C., de Freitas Araujo, M. (2023). A Multi-objective Iterated Local Search Heuristic for Energy-Efficient No-Wait Permutation Flowshop Scheduling Problem. In: Abraham, A., Pllana, S., Casalino, G., Ma, K., Bajaj, A. (eds) Intelligent Systems Design and Applications. ISDA 2022. Lecture Notes in Networks and Systems, vol 717. Springer, Cham. https://doi.org/10.1007/978-3-031-35510-3_17

Download citation

Publish with us

Policies and ethics

Search

Navigation