Dynamic lot sizing problem for a warm/cold process

Simple item page
dc.citation.epage1044en_US
dc.citation.issueNumber11en_US
dc.citation.spage1027en_US
dc.citation.volumeNumber38en_US
dc.contributor.authorToy, A. Ö.en_US
dc.contributor.authorBerk, E.en_US
dc.date.accessioned2016-02-08T10:17:21Z
dc.date.available2016-02-08T10:17:21Z
dc.date.issued2006en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractWe consider a dynamic lot sizing problem with finite capacity for a process that can be kept warm until the next production period at a unit variable cost ωt only if more than a threshold value has been produced and is cold, otherwise. That is, the setup cost in period t is Kt if xt-1 < Qt-1 and kt, otherwise (0 ≤ kt ≤ Kt). We develop a dynamic programming formulation of the problem, establish theoretical results on the structure of the optimal production plan and discuss its computational complexity in the presence of Wagner-Whitin-type cost structures. Based on our stuctural results, we present an optimal polynomial-time solution algorithm for kt = 0, and also show that an optimal linear-time solution algorithm exists for a special case. Our numerical study indicates that utilizing the undertime option (i.e., keeping the process warm via reduced production rates) results in significant cost savings, which has managerial implications for capacity planning and selection.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:17:21Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2006en
dc.identifier.doi10.1080/07408170600854511en_US
dc.identifier.eissn1545-8830
dc.identifier.issn0740-817X
dc.identifier.urihttp://hdl.handle.net/11693/23674
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/07408170600854511en_US
dc.source.titleIIE Transactionsen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectCostsen_US
dc.subjectDynamic programmingen_US
dc.subjectOptimizationen_US
dc.subjectPlanningen_US
dc.subjectCold processen_US
dc.subjectDynamic lot sizing problemen_US
dc.subjectLinear-time solution algorithmen_US
dc.subjectPolynomial-time solution algorithmen_US
dc.subjectWarm processen_US
dc.subjectProcess engineeringen_US
dc.titleDynamic lot sizing problem for a warm/cold processen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Dynamic lot sizing problem for a warm cold process.pdf
Size:
1010.4 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Management