Solving a capacitated flow-shop problem with minimizing total energy costs
- First Online:
- 74 Downloads
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.
KeywordsCapacitated lot-sizing problem Flow-shop Energy Heuristics Genetic algorithm
Unable to display preview. Download preview PDF.