Multi-period lot-sizing with supplier selection: Structural results,complexity and algorithms |
| |
Affiliation: | 1. Sauder School of Business, University of British Columbia, BC V6T 1Z4, Canada;2. Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China |
| |
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 |
本文献已被 ScienceDirect 等数据库收录! |
|