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

  • Oussama Masmoudi
  • Alice Yalaoui
  • Yassine Ouazene
  • Hicham Chehade
ORIGINAL ARTICLE
  • 74 Downloads

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.

Keywords

Capacitated lot-sizing problem Flow-shop Energy Heuristics Genetic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2016

Authors and Affiliations

  • Oussama Masmoudi
    • 1
  • Alice Yalaoui
    • 1
  • Yassine Ouazene
    • 1
  • Hicham Chehade
    • 2
  1. 1.University of Technology of Troyes, ICD, LOSI (UMR-CNRS 6281)TroyesFrance
  2. 2.OPTA LPTechnopole de l’AubeRosires prs TroyesFrance

Personalised recommendations