東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Dynamic patient scheduling for a dia...

Patrick, Jonathan.

FindBook

Google Book

Amazon

博客來

Dynamic patient scheduling for a diagnostic resource.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Dynamic patient scheduling for a diagnostic resource./
作者:	Patrick, Jonathan.
面頁冊數:	134 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-12, Section: A, page: 4611.
Contained By:	Dissertation Abstracts International67-12A.
標題:	Business Administration, Management. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR20066
ISBN:	9780494200667

Dynamic patient scheduling for a diagnostic resource.
Patrick, Jonathan.

Dynamic patient scheduling for a diagnostic resource. - 134 p.

Source: Dissertation Abstracts International, Volume: 67-12, Section: A, page: 4611.

Thesis (Ph.D.)--The University of British Columbia (Canada), 2006.

We take an in-depth look at the scheduling of patients for a diagnostic resource. Our aim is to schedule patients in order to maintain reasonable waiting times for minimal cost. We assume a fixed capacity with stochastic demand coming from multiple priority classes. We further assume that it is the lower priority patients that must be booked first, therefore requiring the resource manager to implement a booking policy to assure room for later arriving higher priority patients. If too much capacity is reserved for higher priority patients then there will inevitably be unused capacity resulting in longer waiting times than might otherwise be the case. If not enough capacity is reserved then higher priority patients will have to be served through overtime or forced to wait longer than recommended. We begin, in Chapter 1, with an international overview of efforts to reduce waiting times. Chapter 2 proposes a scheduling policy assuming only two priority classes and a fixed limit on expected overtime. The higher priority class are inpatients who must be served the day the demand for a scan is placed. The lower priority class consists of outpatients who may be booked weeks in advance. We present a model that gives the optimal reservation policy and examine the benefit of introducing some flexibility into the higher priority (inpatient) class. Chapter 3 then restricts the modeling to outpatients where demand is divided into multiple priority classes. We present a Markov Decision Process that we solve through approximate dynamic programming in order to derive an approximately optimal booking policy that maintains reasonable waiting times for minimal cost. Chapter 4 presents some strong theoretical results as to the nature of the optimal policy from chapter 3 as well as providing bounds on the "deviation from optimality" associated with our approximation. Chapter 5 then adds inpatients to the model in chapter 3 and compares the results of the full model to those given in chapter 2. Finally, we conclude with possible enhancements to the model and policy insights for the resource manager.

ISBN: 9780494200667Subjects--Topical Terms:

626628
Business Administration, Management.

Dynamic patient scheduling for a diagnostic resource.
LDR:02914nmm 2200253 4500 001 1832585
005 20070813115820.5
008 130610s2006 eng d
020 $a 9780494200667
035 $a (UMI)AAINR20066
035 $a AAINR20066
040 $a UMI $c UMI
100 1 $a Patrick, Jonathan. $3 1921308
245 1 0 $a Dynamic patient scheduling for a diagnostic resource.
300 $a 134 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-12, Section: A, page: 4611.
502 $a Thesis (Ph.D.)--The University of British Columbia (Canada), 2006.
520 $a We take an in-depth look at the scheduling of patients for a diagnostic resource. Our aim is to schedule patients in order to maintain reasonable waiting times for minimal cost. We assume a fixed capacity with stochastic demand coming from multiple priority classes. We further assume that it is the lower priority patients that must be booked first, therefore requiring the resource manager to implement a booking policy to assure room for later arriving higher priority patients. If too much capacity is reserved for higher priority patients then there will inevitably be unused capacity resulting in longer waiting times than might otherwise be the case. If not enough capacity is reserved then higher priority patients will have to be served through overtime or forced to wait longer than recommended. We begin, in Chapter 1, with an international overview of efforts to reduce waiting times. Chapter 2 proposes a scheduling policy assuming only two priority classes and a fixed limit on expected overtime. The higher priority class are inpatients who must be served the day the demand for a scan is placed. The lower priority class consists of outpatients who may be booked weeks in advance. We present a model that gives the optimal reservation policy and examine the benefit of introducing some flexibility into the higher priority (inpatient) class. Chapter 3 then restricts the modeling to outpatients where demand is divided into multiple priority classes. We present a Markov Decision Process that we solve through approximate dynamic programming in order to derive an approximately optimal booking policy that maintains reasonable waiting times for minimal cost. Chapter 4 presents some strong theoretical results as to the nature of the optimal policy from chapter 3 as well as providing bounds on the "deviation from optimality" associated with our approximation. Chapter 5 then adds inpatients to the model in chapter 3 and compares the results of the full model to those given in chapter 2. Finally, we conclude with possible enhancements to the model and policy insights for the resource manager.
590 $a School code: 2500.
650 4 $a Business Administration, Management. $3 626628
650 4 $a Health Sciences, General. $3 1017817
690 $a 0454
690 $a 0566
710 2 0 $a The University of British Columbia (Canada). $3 626643
773 0 $t Dissertation Abstracts International $g 67-12A.
790 $a 2500
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR20066