Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 248, Issue 3, Pages 849-855Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2015.07.052
Keywords
Lot sizing; Periodic carbon emission constraint; Multi-mode; Dynamic programming; Complexity analysis
Ask authors/readers for more resources
We consider in this paper a single-item lot sizing problem with a periodic carbon emission constraint. In each period, the carbon emission constraint defines an upper limit on the average emission per product. Different modes are available, each one is characterized by its own cost and carbon emission parameters. The problem consists in selecting the modes used in each period such that no carbon emission constraint is violated, and the cost of satisfying all the demands on a given time horizon is minimized. This problem has been introduced in Absi et al. (2013), and has been shown polynomially solvable when only unit carbon emissions are considered. In this paper, we extend the analysis for this constraint to the realistic case of a fixed carbon emission associated with each mode, in addition to its unit carbon emission. We establish that this generalization renders the problem NP-hard. Several dominant properties are presented, and two dynamic programming algorithms are proposed. We also establish that the problem can be solved in polynomial time for a fixed number of modes when carbon emission parameters are stationary. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available