File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A fast procedure for computing the total system cost of an appointment schedule for medical and kindred facilities

TitleA fast procedure for computing the total system cost of an appointment schedule for medical and kindred facilities
Authors
Issue Date2000
PublisherTaylor & Francis Inc. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0740817x.asp
Citation
IIE Transactions (Institute Of Industrial Engineers), 2000, v. 32 n. 9, p. 833-839 How to Cite?
AbstractScheduling 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". © 2000 "IIE".
Persistent Identifierhttp://hdl.handle.net/10722/177879
ISSN
2015 Impact Factor: 1.463
2015 SCImago Journal Rankings: 1.293
References

 

DC FieldValueLanguage
dc.contributor.authorLau, HSen_US
dc.contributor.authorLau, AHLen_US
dc.date.accessioned2012-12-19T09:40:40Z-
dc.date.available2012-12-19T09:40:40Z-
dc.date.issued2000en_US
dc.identifier.citationIIE Transactions (Institute Of Industrial Engineers), 2000, v. 32 n. 9, p. 833-839en_US
dc.identifier.issn0740-817Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/177879-
dc.description.abstractScheduling 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". © 2000 "IIE".en_US
dc.languageengen_US
dc.publisherTaylor & Francis Inc. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0740817x.aspen_US
dc.relation.ispartofIIE Transactions (Institute of Industrial Engineers)en_US
dc.titleA fast procedure for computing the total system cost of an appointment schedule for medical and kindred facilitiesen_US
dc.typeArticleen_US
dc.identifier.emailLau, AHL: ahlau@business.hku.hken_US
dc.identifier.authorityLau, AHL=rp01072en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1023/A:1007682909695-
dc.identifier.scopuseid_2-s2.0-0034274190en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034274190&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume32en_US
dc.identifier.issue9en_US
dc.identifier.spage833en_US
dc.identifier.epage839en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLau, HS=7201497264en_US
dc.identifier.scopusauthoridLau, AHL=7202626080en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats