東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Essays on Scheduling Models in Servi...

Li, Fei.

FindBook

Google Book

Amazon

博客來

Essays on Scheduling Models in Service Systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Essays on Scheduling Models in Service Systems./
作者:	Li, Fei.
面頁冊數:	151 p.
附註:	Source: Dissertation Abstracts International, Volume: 76-01(E), Section: B.
Contained By:	Dissertation Abstracts International76-01B(E).
標題:	Engineering, Industrial. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3635195
ISBN:	9781321161670

Essays on Scheduling Models in Service Systems.
Li, Fei.

Essays on Scheduling Models in Service Systems. - 151 p.

Source: Dissertation Abstracts International, Volume: 76-01(E), Section: B.

Thesis (Ph.D.)--University of Minnesota, 2014.

This item must not be sold to any third party vendors.

Scheduling has been a fundamental area in Operations Research and is receiving increasing attention. Growing scale of operations and increasing availability of data in different industries drive the need for efficient and practical solutions for scheduling resources under customized circumstances. In this thesis, we address three different scheduling problems that come from transit industry and healthcare industry respectively. According to the special features encountered in each industry, we build fixed job scheduling models for the reserve driver scheduling and work assignment problems for transit industry, and resource-constrained bin packing models for the surgery reschedul- ing problems in healthcare. Three separate but related chapters constitute the main body of the thesis.

ISBN: 9781321161670Subjects--Topical Terms:

626639
Engineering, Industrial.

Essays on Scheduling Models in Service Systems.
LDR:02930nmm a2200313 4500 001 2057027
005 20150630121441.5
008 170521s2014 ||||||||||||||||| ||eng d
020 $a 9781321161670
035 $a (MiAaPQ)AAI3635195
035 $a AAI3635195
040 $a MiAaPQ $c MiAaPQ
100 1 $a Li, Fei. $3 1035368
245 1 0 $a Essays on Scheduling Models in Service Systems.
300 $a 151 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-01(E), Section: B.
500 $a Adviser: Diwakar Gupta.
502 $a Thesis (Ph.D.)--University of Minnesota, 2014.
506 $a This item must not be sold to any third party vendors.
520 $a Scheduling has been a fundamental area in Operations Research and is receiving increasing attention. Growing scale of operations and increasing availability of data in different industries drive the need for efficient and practical solutions for scheduling resources under customized circumstances. In this thesis, we address three different scheduling problems that come from transit industry and healthcare industry respectively. According to the special features encountered in each industry, we build fixed job scheduling models for the reserve driver scheduling and work assignment problems for transit industry, and resource-constrained bin packing models for the surgery reschedul- ing problems in healthcare. Three separate but related chapters constitute the main body of the thesis.
520 $a Among the three models, two models are deterministic and are proved to be NP-hard. The other model is an online version of the reserve driver work assignment problem. Our target is to provide algorithms that run in polynomial or pseudo-polynomial time and can beat the best-known algorithm in terms of worst-case performance guarantee. For the offline reserve driver scheduling and work assignment problem, we provide an algorithm with approximation ratio between [1 - 1/e, 19/27]; and for the online reserve driver work assignment problem, we build a randomized algorithm with O(log Delta) competitive ratio, where Delta is the ratio of the longest to the shortest job in duration. For the surgery rescheduling problem the model is not widely studied and we are the first to provide an algorithm and a lower bound with performance guarantee---the worst-case performance guarantee is 3/2 for the approximation algorithm, and 2/3 for the lower bound.
520 $a We not only are interested in theoretical results but also care about practical use of our algorithms. All algorithms are experimented with real data and we benchmark with either the current industry performance or a greedy algorithm/policy.
590 $a School code: 0130.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Operations Research. $3 626629
690 $a 0546
690 $a 0796
710 2 $a University of Minnesota. $b Industrial and Systems Engineering. $3 3170834
773 0 $t Dissertation Abstracts International $g 76-01B(E).
790 $a 0130
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3635195