Solving a capacitated flow-shop problem with minimizing total energy costs - Archive ouverte HAL Access content directly
Journal Articles International Journal of Advanced Manufacturing Technology Year : 2017

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

(1) , (1) , (1) , (2)
1
2
Hicham Chehade
  • Function : Author
  • PersonId : 952568

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.
Not file

Dates and versions

hal-02507785 , version 1 (13-03-2020)

Identifiers

Cite

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, 2017, 90 (9-12), pp.2655-2667. ⟨10.1007/s00170-016-9557-5⟩. ⟨hal-02507785⟩

Collections

CNRS UTT LOSI
10 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More