Abstract
We consider the single-item lot-sizing problem with inventory bounds under a carbon emissions constraint with two options for producing items: regular or green. We wish to find the optimal production plan so that the total carbon emissions from production cannot exceed the carbon emissions capacity in each period. Extending a problem without fixed carbon emissions and inventory bounds, we show that the extended problem is polynomially solvable by a dynamic programming algorithm.
Original language | English |
---|---|
Pages (from-to) | 339-343 |
Number of pages | 5 |
Journal | Operations Research Letters |
Volume | 47 |
Issue number | 5 |
DOIs | |
Publication status | Published - Sept 2019 |
Keywords
- Carbon emissions constraint
- Dynamic lot-sizing
- Dynamic programming
- Inventory bounds
- Two production modes
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics