Publication Type
Journal Article
Version
acceptedVersion
Publication Date
6-2021
Abstract
We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we extend the classical zero-inventory-ordering principle and solve it by dynamic programming. Based on this new extension, we also develop a heuristic algorithm for the general problem and computationally show that it works well.
Keywords
Lot-sizing and scheduling, Algorithm, Computational complexity, Supply chain
Discipline
Operations and Supply Chain Management | Operations Research, Systems Engineering and Industrial Engineering
Research Areas
Operations Management
Publication
Operations Research Letters
Volume
49
Issue
4
First Page
602
Last Page
609
ISSN
0167-6377
Identifier
10.1016/j.orl.2021.05.013
Publisher
Elsevier
Citation
LIN, Meichun; HUH, Woonghee Tim; and WAN, Guohua.
Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms. (2021). Operations Research Letters. 49, (4), 602-609.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/7303
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1016/j.orl.2021.05.013
Included in
Operations and Supply Chain Management Commons, Operations Research, Systems Engineering and Industrial Engineering Commons
