Production planning with price-dependent supply capacity
Z. Melis Teksan and
Joseph Geunes
IISE Transactions, 2016, vol. 48, issue 10, 938-954
Abstract:
We consider a production planning problem in which a producer procures an input component for production by offering a price to suppliers. The available supply quantity for the production input depends on the price the producer offers, and this supply level constrains production output. The producer seeks to meet a set of demands over a finite horizon at a minimum cost, including component procurement costs. We model the problem as a discrete-time production and component supply–pricing planning problem with nonstationary costs, demands, and component supply levels. This leads to a two-level lot-sizing problem with an objective function that is neither concave nor convex. Although the most general version of the problem is NP$\mathcal {NP}$-hard, we provide polynomial-time algorithms for two special cases of the model under particular assumptions on the cost structure. We then apply the resulting algorithms heuristically to the more general problem version and provide computational results that demonstrate the high performance quality of the resulting heuristic solution methods.
Date: 2016
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2016.1189628 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:48:y:2016:i:10:p:938-954
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20
DOI: 10.1080/0740817X.2016.1189628
Access Statistics for this article
IISE Transactions is currently edited by Jianjun Shi
More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().