國立虎尾科技大學 |

Mitigating Hard Capacity Constraints in Facility Location Modeling.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Mitigating Hard Capacity Constraints in Facility Location Modeling./
作者:	Maass, Kayse.
面頁冊數:	1 online resource (230 pages)
附註:	Source: Dissertation Abstracts International, Volume: 78-11(E), Section: B.
Contained By:	Dissertation Abstracts International78-11B(E).
標題:	Industrial engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9781369902785

Mitigating Hard Capacity Constraints in Facility Location Modeling.
Maass, Kayse.

Mitigating Hard Capacity Constraints in Facility Location Modeling. - 1 online resource (230 pages)

Source: Dissertation Abstracts International, Volume: 78-11(E), Section: B.

Thesis (Ph.D.)

Includes bibliographical references

In many real-world settings, the capacity of processing centers is flexible due to a variety of operational tools (such as overtime, outsourcing, and backlogging demand) available to managers that allow the facility to accept demands in excess of the capacity constraint for short periods of time. However, most capacitated facility location models in the literature today impose hard capacity constraints that don't capture this short term flexibility. Thus, current capacitated facility location models do not account for the operational costs associated with accepting excess daily demand, which can lead to suboptimal facility location and demand allocation decisions.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781369902785Subjects--Topical Terms:

679492
Industrial engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Mitigating Hard Capacity Constraints in Facility Location Modeling.
LDR:04932ntm a2200385Ki 4500 001 910534
005 20180517123957.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9781369902785
035 $a (MiAaPQ)AAI10612145
035 $a (MiAaPQ)umichrackham:000703
035 $a AAI10612145
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Maass, Kayse. $3 1181872
245 1 0 $a Mitigating Hard Capacity Constraints in Facility Location Modeling.
264 0 $c 2017
300 $a 1 online resource (230 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-11(E), Section: B.
500 $a Adviser: Mark Stephen Daskin.
502 $a Thesis (Ph.D.) $c University of Michigan $d 2017.
504 $a Includes bibliographical references
520 $a In many real-world settings, the capacity of processing centers is flexible due to a variety of operational tools (such as overtime, outsourcing, and backlogging demand) available to managers that allow the facility to accept demands in excess of the capacity constraint for short periods of time. However, most capacitated facility location models in the literature today impose hard capacity constraints that don't capture this short term flexibility. Thus, current capacitated facility location models do not account for the operational costs associated with accepting excess daily demand, which can lead to suboptimal facility location and demand allocation decisions.
520 $a To address this discrepancy, we consider a processing distribution system in which demand generated on a daily basis by a set of demand sites is satisfied by a set of capacitated processing facilities. At each demand site, daily demands for the entirety of the planning horizon are sampled from a known demand distribution. Thus, the day to day demand fluctuations may result in some days for which the total demand arriving at a processing facility exceeds the processing capacity, even if the average daily demand arriving at the processing facility is less than the daily processing capacity. We allow each processing facility the ability to hold excess demand in backlog to be processed at a later date and assess a corresponding backlog penalty in the objective function for each day a unit of demand is backlogged.
520 $a This dissertation primarily focuses on three methods of modeling the aforementioned processing distribution system. The first model is the Inventory Modulated Capacitated Location Problem (IMCLP), which utilizes disaggregated daily demand parameters to determine the subset of processing facilities to establish, the allocation of demand sites to processing facilities, and the magnitude of backlog at each facility on each day that minimizes location, travel, and backlogging costs. Whereas the IMCLP assumes each demand site must be allocated to exactly one processing facility, the second model relaxes this assumption and allows demand sites to be allocated to different processing facilities on various days of the week. We show that such a cyclic allocation scheme can further reduce the system costs and improve service metrics as compared to the IMCLP.
520 $a Finally, while the first two models incorporate daily fluctuations in demand over an extended time horizon, the problems remain deterministic in the sense that only one realization of demand is considered for each day of the planning horizon. As such, our final model presents a stochastic version of the IMCLP in which we assume a known demand distribution but assume the realization of daily demand is uncertain. In addition to assessing a penalty cost, we consider three types of chance constraints to restrict the amount of backlogged demand to a predetermined threshold. Using finite samples of random demand, we propose two multi-stage decomposition schemes and solve the mixed-integer programming reformulations with cutting-plane algorithms.
520 $a In summary, this dissertation mitigates hard capacity constraints commonly found in facility location models by allowing incoming demand to exceed the processing capacity for short periods of time. In each of the modeling contexts presented, we show that the location and allocation decisions obtained from our models can result in significantly reduced costs and improved service metrics when compared to models that do not account for the likelihood that demands may exceed capacity on some days.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Michigan. $b Industrial and Operations Engineering. $3 1181873
773 0 $t Dissertation Abstracts International $g 78-11B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10612145 $z click for full text (PQDT)