東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Scheduling policies in service networks.

Wang, Jianfu.

Linked to FindBook

Google Book

Amazon

博客來

Scheduling policies in service networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Scheduling policies in service networks./
Author:	Wang, Jianfu.
Description:	147 p.
Notes:	Source: Dissertation Abstracts International, Volume: 76-04(E), Section: B.
Contained By:	Dissertation Abstracts International76-04B(E).
Subject:	Operations Research. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3666674
ISBN:	9781321397659

Scheduling policies in service networks.
Wang, Jianfu.

Scheduling policies in service networks. - 147 p.

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

Thesis (Ph.D.)--University of Toronto (Canada), 2014.

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

In this thesis, we study different scheduling policies in service networks. In Chapter 2, we consider two service level (SL) measures in a two-server tandem queue system: the average sojourn time and the probability of long waits. We demonstrate that a family of Threshold Based Policies (TBP) can reduce the probability of long waits while maintaining sojourn times that are only slightly higher than those of a non-idling policy. In Chapter 3, we present a case study for improving the operations of a healthcare provider that has an open-shop queueing network. We propose an effective implementation of Dynamic Scheduling Policies (DSPs) and a generalized TBP to improve the SL in an open-shop queueing networks. Using a simulation model we demonstrate that an open-shop queueing network can be managed in a systematic fashion to deliver improved SL. In Chapter 4, we study the waiting time distribution of two different priority classes in an M/M/c queue with different service times. For the c = 2 case, we provide closed form expression of the Generating Function (GF) of the number of low-priority jobs in the system, which can lead to the waiting time distribution. For c > 2 case, we present an efficient numerical algorithm for deriving this GF. We discuss several insights gained from numerical results.

ISBN: 9781321397659Subjects--Topical Terms:

626629
Operations Research.

Scheduling policies in service networks.
LDR:02332nmm a2200301 4500 001 2057045
005 20150630121444.5
008 170521s2014 ||||||||||||||||| ||eng d
020 $a 9781321397659
035 $a (MiAaPQ)AAI3666674
035 $a AAI3666674
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wang, Jianfu. $3 3170856
245 1 0 $a Scheduling policies in service networks.
300 $a 147 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-04(E), Section: B.
500 $a Advisers: Opher Baron; Oded Berman; Dmitry Krass.
502 $a Thesis (Ph.D.)--University of Toronto (Canada), 2014.
506 $a This item must not be sold to any third party vendors.
506 $a This item must not be added to any third party search indexes.
520 $a In this thesis, we study different scheduling policies in service networks. In Chapter 2, we consider two service level (SL) measures in a two-server tandem queue system: the average sojourn time and the probability of long waits. We demonstrate that a family of Threshold Based Policies (TBP) can reduce the probability of long waits while maintaining sojourn times that are only slightly higher than those of a non-idling policy. In Chapter 3, we present a case study for improving the operations of a healthcare provider that has an open-shop queueing network. We propose an effective implementation of Dynamic Scheduling Policies (DSPs) and a generalized TBP to improve the SL in an open-shop queueing networks. Using a simulation model we demonstrate that an open-shop queueing network can be managed in a systematic fashion to deliver improved SL. In Chapter 4, we study the waiting time distribution of two different priority classes in an M/M/c queue with different service times. For the c = 2 case, we provide closed form expression of the Generating Function (GF) of the number of low-priority jobs in the system, which can lead to the waiting time distribution. For c > 2 case, we present an efficient numerical algorithm for deriving this GF. We discuss several insights gained from numerical results.
590 $a School code: 0779.
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, System Science. $3 1018128
690 $a 0796
690 $a 0790
710 2 $a University of Toronto (Canada). $b Management. $3 2102915
773 0 $t Dissertation Abstracts International $g 76-04B(E).
790 $a 0779
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3666674