Please use this identifier to cite or link to this item:
Title: A fast procedure for computing the total system cost of an appointment schedule for medical and kindred facilities
Authors: Lau, HS
Lau, AHL
Issue Date: 2000
Publisher: Kluwer Academic Publishers
Source: IIE transactions, 2000, v. 32, no. 9, p. 833-839 How to cite?
Journal: IIE transactions 
Abstract: Scheduling outpatients and medical operation rooms has the following structure: N users are given appointment times to use a facility, the duration required by the facility to service each user is stochastic. The system incurs a "user idle cost" if a user arriving at the appointed time finds the facility still engaged by preceding users, while a "facility idle cost" is incurred if the facility becomes free before the next user arrives. We develop an accurate procedure to compute the expected total system costs for any given appointment schedule. Compared to earlier related procedures, ours is much faster and can handle larger problems as well as very general service-time distributions. We then show that this fast computation procedure enables one to determine easily the "lowest-cost appointment schedule" for any given "job" (i.e., "user") sequence. This in turn will enable one to search for the optimal job sequence that has the best "lowest-cost appointment schedule".
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1023/A:1007682909
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of May 18, 2020

Page view(s)

Last Week
Last month
Citations as of May 6, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.