| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142109 | Operations Research Letters | 2015 | 5 Pages |
Abstract
We study a capacitated lot-sizing problem with outsourcing, in which the production capacity is constant and the outsourcing is uncapacitated. In each period, the demand can be satisfied by both production and outsourcing. We develop a dynamic programming-based algorithm to solve this problem in polynomial time.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Minjiao Zhang,