Capacity expansion under a service level constraint for uncertain demand with lead times
Capacity expansion under a service level constraint for uncertain demand with lead times
dc.contributor.advisor | Sarah M. Ryan | |
dc.contributor.author | Marathe, Rahul | |
dc.contributor.department | Industrial and Manufacturing Systems Engineering | |
dc.date | 2018-08-24T21:31:03.000 | |
dc.date.accessioned | 2020-06-30T07:44:23Z | |
dc.date.available | 2020-06-30T07:44:23Z | |
dc.date.copyright | Sun Jan 01 00:00:00 UTC 2006 | |
dc.date.issued | 2006-01-01 | |
dc.description.abstract | <p>For a service provider, stochastic demand growth along with expansion lead times and economies of scale may complicate a capacity planning problem. We consider a service provider who has to maintain certain minimum level of service and is interested in knowing the optimal timings and sizes of the future capacity expansions. This service level is defined in terms of unsatisfied demand over an expansion cycle. Under this service level constraint, the service provider wants to minimize the infinite time horizon cost of expansion. We assume a stationary policy where the timing and the sizes of the expansions are determined as fixed proportions of the capacity position, where the capacity position is the capacity that will be available when the current expansion is completed. We assume that the demand for the capacity follows a geometric Brownian motion (GBM) process. We discuss a method to check the GBM process fit for any data series representing the demand values and find that the data for electric utility consumption in the US, and the airline passenger enplanement data over a period of 15 years satisfy the assumptions of a GBM process. Using properties of the demand process, we can use financial option pricing theory to express the service level in terms of the decision variables. Particularly, we use the Up-and-Out partial barrier call option price expression to formulate the service level constraint. We use cutting plane algorithm to solve the optimization problem. Numerical optimization shows that it could be optimal to accumulate initial shortage before initiating the next capacity expansions for a low growth, low volatility demand and also when the expansion lead times are shorter. However, when the demand grows at a high rate or is more volatile, it is optimal to start the next expansion project before the demand reaches the current capacity position.</p> | |
dc.format.mimetype | application/pdf | |
dc.identifier | archive/lib.dr.iastate.edu/rtd/1542/ | |
dc.identifier.articleid | 2541 | |
dc.identifier.contextkey | 6094979 | |
dc.identifier.doi | https://doi.org/10.31274/rtd-180813-12041 | |
dc.identifier.s3bucket | isulib-bepress-aws-west | |
dc.identifier.submissionpath | rtd/1542 | |
dc.identifier.uri | https://dr.lib.iastate.edu/handle/20.500.12876/69051 | |
dc.language.iso | en | |
dc.source.bitstream | archive/lib.dr.iastate.edu/rtd/1542/r_3229103.pdf|||Fri Jan 14 20:40:50 UTC 2022 | |
dc.subject.disciplines | Industrial Engineering | |
dc.subject.keywords | Industrial and manufacturing systems engineering | |
dc.subject.keywords | Industrial engineering | |
dc.title | Capacity expansion under a service level constraint for uncertain demand with lead times | |
dc.type | article | |
dc.type.genre | dissertation | |
dspace.entity.type | Publication | |
relation.isOrgUnitOfPublication | 51d8b1a0-5b93-4ee8-990a-a0e04d3501b1 | |
thesis.degree.level | dissertation | |
thesis.degree.name | Doctor of Philosophy |
File
Original bundle
1 - 1 of 1