Production scheduling with a piecewise-linear energy cost function

摘要

We tackle a production scheduling problem in a manufacturing system. The aim is to design an efficient exact method and find a trade-off between tardiness, storage and energy costs described by a piecewise-linear function. Therefore, we propose two time-based MILP formulations. The first one is precedence-oriented and the second is storage-oriented. These two formulations are compared and tested on realistic instances in order to show their limits. Good solutions are obtained, even on the biggest instance.