東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Partial Flexibility in Routing and S...

Akgun, Osman Tansu.

FindBook

Google Book

Amazon

博客來

Partial Flexibility in Routing and Scheduling.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Partial Flexibility in Routing and Scheduling./
作者:	Akgun, Osman Tansu.
面頁冊數:	95 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-07(E), Section: B.
Contained By:	Dissertation Abstracts International74-07B(E).
標題:	Operations Research. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3555539
ISBN:	9781267971586

Partial Flexibility in Routing and Scheduling.
Akgun, Osman Tansu.

Partial Flexibility in Routing and Scheduling. - 95 p.

Source: Dissertation Abstracts International, Volume: 74-07(E), Section: B.

Thesis (Ph.D.)--University of California, Berkeley, 2012.

In many service, production, and traffic systems there are multiple types of customers requiring different types of servers, i.e., different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e., they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We study partial flexibility in multi-server queueing systems. Some (dedicated) arrivals are obliged to use a particular station, while others (flexible) have the ability to use any of the stations.

ISBN: 9781267971586Subjects--Topical Terms:

626629
Operations Research.

Partial Flexibility in Routing and Scheduling.
LDR:03535nmm a2200325 4500 001 2057331
005 20150610074908.5
008 170521s2012 ||||||||||||||||| ||eng d
020 $a 9781267971586
035 $a (MiAaPQ)AAI3555539
035 $a AAI3555539
040 $a MiAaPQ $c MiAaPQ
100 1 $a Akgun, Osman Tansu. $3 3171158
245 1 0 $a Partial Flexibility in Routing and Scheduling.
300 $a 95 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-07(E), Section: B.
500 $a Adviser: Rhonda L. Righter.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2012.
520 $a In many service, production, and traffic systems there are multiple types of customers requiring different types of servers, i.e., different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e., they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We study partial flexibility in multi-server queueing systems. Some (dedicated) arrivals are obliged to use a particular station, while others (flexible) have the ability to use any of the stations.
520 $a We first consider the optimal routing policy for the flexible customers under various settings. Flexible customers should be routed by the decision maker to one of queues upon arrival. When the only information available upon arrival is the queue lengths, then "Join the Shortest Queue" (JSQ) has been shown to be optimal in a variety of contexts. We generalize earlier results on the optimality of "Join the Shortest Queue" for flexible arrivals to the following: arbitrary arrivals where only a subset are flexible, multiple-server stations, and abandonments. Our optimality results are very strong; we minimize the queue length process in the weak majorization sense. When the actual workload at each queue is known upon arrival but the required work of the arriving customer is unknown, we show that routing flexible customers to the queue with the shortest workload, known in the literature as the "Join the Shortest Work" (JSW) policy, is optimal for general arrival and service processes.
520 $a Secondly, we study the scheduling problem in an alternate design where the flexible customers have a separate queue to wait. We show that the optimal scheduling policy is "Dedicated Customers First" (DCF) policy under various settings. This design is better than the routing design in terms of system performance; however it is not a good design in terms of fairness, because flexible customers face long waiting times.
520 $a Finally we consider the marginal impact of customer flexibility. We present our new results showing that the stationary expected waiting time is decreasing and convex in the proportion of flexible customers. Although convexity in the proportion of flexible customers is intuitive, it does not hold in the strong sense that monotonicity holds, and it is surprisingly difficult to prove. We develop a new approach that combines marginal analysis with coupling to show convexity in the stationary mean waiting time. Our results reinforce the idea that a little flexibility goes a long way.
590 $a School code: 0028.
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Applied Mathematics. $3 1669109
690 $a 0796
690 $a 0546
690 $a 0364
710 2 $a University of California, Berkeley. $b Industrial Engineering & Operations Research. $3 1672475
773 0 $t Dissertation Abstracts International $g 74-07B(E).
790 $a 0028
791 $a Ph.D.
792 $a 2012
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3555539