A Multi-Level Capacitated Lot-Sizing Problem with energy consideration

摘要

This paper reports on a new Multi-Level Capacitated Lot-Sizing Problem (MLCLSP) taking into account the energetic aspect. A linear mixed integer programming model is proposed to solve this problem. Since the MLCLSP is NP-hard ([10]), two heuristics, that provide solutions in a reasonable computational time, are developed. In this study, the horizon is split into T periods where each one is characterized by a duration, an electricity cost, a maximum peak power and a demand. To evaluate the performance of the model and the heuristics, computational experiments are presented and numerical results are discussed.