Multi-item capacitated lot-sizing problems with setup times and pricing decisions
dc.contributor.author | Önal, Mehmet | en_US |
dc.contributor.author | Romeijn, H. Edwin | en_US |
dc.date.accessioned | 2010-03-01T20:20:35Z | |
dc.date.available | 2011-02-01T20:36:35Z | en_US |
dc.date.issued | 2010-03 | en_US |
dc.identifier.citation | Önal, Mehmet; Romeijn, H. Edwin (2010). "Multi-item capacitated lot-sizing problems with setup times and pricing decisions." Naval Research Logistics 57(2): 172-187. <http://hdl.handle.net/2027.42/65027> | en_US |
dc.identifier.issn | 0894-069X | en_US |
dc.identifier.issn | 1520-6750 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/65027 | |
dc.description.abstract | We study a multi-item capacitated lot-sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot-sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch-and-price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 | en_US |
dc.format.extent | 471549 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.publisher | Wiley Subscription Services, Inc., A Wiley Company | en_US |
dc.subject.other | Mathematics and Statistics | en_US |
dc.title | Multi-item capacitated lot-sizing problems with setup times and pricing decisions | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, The University of Michigan, 1205 Beal Avenue, Ann Arbor, Michigan 48109-2117 ; Department of Industrial and Operations Engineering, The University of Michigan, 1205 Beal Avenue, Ann Arbor, Michigan 48109-2117 | en_US |
dc.contributor.affiliationother | Innovative Scheduling, Inc., Gainesville Technology Enterprise Center (GTEC), 2153 SE Hawthorne Road, Suite 128, Gainesville, Florida 32641 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/65027/1/20394_ftp.pdf | |
dc.identifier.doi | 10.1002/nav.20394 | en_US |
dc.identifier.source | Naval Research Logistics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.