Skip to Main content Skip to Navigation
Journal articles

Energy-aware lot sizing problem: Complexity analysis and exact algorithms

Abstract : The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost for starting-up the machines, a reservation cost to keep the machines ready for production, in addition to classical lot sizing costs, such as, joint setup cost, unit production cost and unit holding cost, all being time-dependent. Besides the classical lot sizing decisions of how much and in which periods to produce, we have to decide the number of machines to switch on and to switch off in each period. We show that this problem is NP-hard even under restricted conditions. In contrast, assuming stationary energy parameters, we propose two polynomial time dynamic programming algorithms to solve the problem to optimality. The first algorithm is proposed for the case with null setup cost, null reservation cost and null reservation energy consumption, and runs in O(M 5 T 4) time, with M being the number of machines and T the number of periods. We show that we can extend this algorithm to solve the generalized version of the problem in time complexity O(M 6 T 6).
Document type :
Journal articles
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01837881
Contributor : Christophe Rapine Connect in order to contact the contributor
Submitted on : Thursday, July 12, 2018 - 10:43:41 PM
Last modification on : Thursday, July 26, 2018 - 1:15:32 AM
Long-term archiving on: : Monday, October 15, 2018 - 12:55:39 PM

File

article_accepted.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Christophe Rapine, Guillaume Goisque, Ayse Akbalik. Energy-aware lot sizing problem: Complexity analysis and exact algorithms. International Journal of Production Economics, Elsevier, 2018, 203, pp.254 - 263. ⟨10.1016/j.ijpe.2018.06.020⟩. ⟨hal-01837881⟩

Share

Metrics

Record views

110

Files downloads

410