Skip to Main content Skip to Navigation
Journal articles

Solving a capacitated flow-shop problem with minimizing total energy costs

Abstract : In this paper, a single-item capacitated lot-sizing problem in a flow-shop system with energy consideration is addressed. The planning horizon is split into T periods where each one is characterized by a duration, an electricity cost, a maximum peak power and a demand. This problem is NP-hard, since its simple version is known to be NP-hard. Therefore, to deal with the complexity and to find good quality solutions in a reasonable time, a fix-and-relax heuristic and a genetic algorithm are developed. Computational experiments are performed on different instances to show the efficiency of these proposed heuristics. To evaluate their performances, problems of different scales have been studied and analyzed.
Document type :
Journal articles
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02507785
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, March 13, 2020 - 3:13:10 PM
Last modification on : Wednesday, October 6, 2021 - 3:46:04 PM

Identifiers

Collections

UTT | CNRS

Citation

Oussama Masmoudi, Alice Yalaoui, Yassine Ouazene, Hicham Chehade. Solving a capacitated flow-shop problem with minimizing total energy costs. International Journal of Advanced Manufacturing Technology, Springer Verlag, 2017, 90 (9-12), pp.2655-2667. ⟨10.1007/s00170-016-9557-5⟩. ⟨hal-02507785⟩

Share

Metrics

Record views

97