Capacitated Lot-sizing Problem with Outsourcing
Department
Economics, Finance and Quantitative Analysis
Document Type
Article
Publication Date
9-1-2015
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.
Journal Title
Operations Research Letters
Journal ISSN
0167-6377
Volume
43
Issue
5
First Page
479
Last Page
483
Digital Object Identifier (DOI)
10.1016/j.orl.2015.06.007
COinS