Evaluation of various scheduling disciplines by computer systems Export

@inproceedings{citeulike:3749813, abstract = {The assignment of patients to examination rooms in a diagnostic radiology department can be categorized as a job-shop scheduling problem. This paper shows a way of using a GPSS (General Purpose Simulation System) discrete event simulation model to test, analyze and find the best heuristic scheduling algorithms that can be applied to patient flow in a diagnostic radiology department. Four main measures of performance are considered; waiting time before examination, total time in the system, utilization of staff and equipment, and the number of patients in the system at the end of a working day. Among the scheduling disciplines tested include the following six; smallest number of patients in each queue, smallest work load in each queue, shortest processing time (SPT), truncated SPT (with priorities), common queue (patients join a single queue versus multiple queues based on examination type), and truncated common queue. Numerical data of Temple University's Radiology Department are included, and results indicate that two scheduling disciplines are superior to the others. Finally, a feasibility study of implementing the findings with and without a computer are discussed.}, address = {New York, NY, USA}, author = {Lev, Benjamin and Caltagirone, Robert J.}, booktitle = {WSC '74: Proceedings of the 7th conference on Winter simulation}, citeulike-article-id = {3749813}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=811197}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/800287.811197}, doi = {10.1145/800287.811197}, keywords = {phd, planning, toget}, location = {Washington, DC}, pages = {365--370}, posted-at = {2008-12-05 10:48:37}, priority = {2}, publisher = {ACM}, title = {Evaluation of various scheduling disciplines by computer systems}, url = {http://dx.doi.org/10.1145/800287.811197}, year = {1974} }

TY - CONF ID - citeulike:3749813 L3 - citeulike-article-id:3749813 N2 - The assignment of patients to examination rooms in a diagnostic radiology department can be categorized as a job-shop scheduling problem. This paper shows a way of using a GPSS (General Purpose Simulation System) discrete event simulation model to test, analyze and find the best heuristic scheduling algorithms that can be applied to patient flow in a diagnostic radiology department. Four main measures of performance are considered; waiting time before examination, total time in the system, utilization of staff and equipment, and the number of patients in the system at the end of a working day. Among the scheduling disciplines tested include the following six; smallest number of patients in each queue, smallest work load in each queue, shortest processing time (SPT), truncated SPT (with priorities), common queue (patients join a single queue versus multiple queues based on examination type), and truncated common queue. Numerical data of Temple University's Radiology Department are included, and results indicate that two scheduling disciplines are superior to the others. Finally, a feasibility study of implementing the findings with and without a computer are discussed. CY - Washington, DC AD - New York, NY, USA EP - 370 TI - Evaluation of various scheduling disciplines by computer systems PB - ACM T2 - WSC '74: Proceedings of the 7th conference on Winter simulation SP - 365 KW - phd KW - planning KW - toget AU - Lev, Benjamin AU - Caltagirone, Robert PY - 1974/// UR - http://dx.doi.org/10.1145/800287.811197 ER -