nach oben

Journal of Medical Systems

Erschienen in:

01.06.2012 | Original Paper

ACO for the Surgical Cases Assignment Problem

verfasst von: Charbel Rizk, Jean-Paul Arnaout

Erschienen in: Journal of Medical Systems | Ausgabe 3/2012

Einloggen, um Zugang zu erhalten

Abstract

This paper addresses the Surgical Case Assignment Problem with an objective of minimizing the total unexploited and operating cost. A two-stage ant colony optimization (ACO) algorithm is introduced and its performance is evaluated by comparing its solutions to the solutions of Branch and Bound and a global solver. The results show that ACO outperformed the other algorithms and reached better solutions in a faster computational time.

ACOforSCAP., Accessed October 09, 2010 from http://sites.google.com/site/jparnaout/acoforscap, 2010.

Arnaout, J.-P., Heuristics for the maximization of Operating Rooms utilization using Simulation. Simulation. 86:573–583, 2010.CrossRef

Arnaout, J.-P., Rabadi, G., and Musa, R., A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf. 21:693–701, 2010.CrossRef

Blake, J. T., and Donald, J., Mount Sinai hospital uses integer-programming to allocate operating room time. Interfaces. 32(2):63–73, 2002.CrossRef

Cardoen, B., Demeulemeester, E., and Belien, J., Operating room planning and scheduling: A literature review. Eur. J. Oper. Res. 201:921–932, 2010.MATHCrossRef

Clergue, F., Gestion du bloc opératoire: Pourquoi une telle préoccupation? Informations cliniques en Anesthésie-Réanimation, 93–95, 1999.

Dexter, F., Macario, A., Traub, R., Hopwood, M., and Lubarsky, D., An operating room scheduling strategy to maximize the use of operating room block time: Computer simulation of patient scheduling and survey of patients’ preferences for surgical waiting time. Anesth. Analg. 89:7–20, 1999.

Dexter, F., A strategy to decide whether to move the last case of the day in an operating room to another empty operating room to decrease overtime labor costs. Anesth. Analg. 91:925–928, 2000.CrossRef

Dorigo, M., Optimization, learning and natural algorithms, PhD thesis, Politecnico di Milano, Italie, 1992.

10.

Dorigo, M., and Stützle, T., Ant colony optimization. MIT Press, 2004.

11.

Fei, H., Chu, C., Meskens, N., and Artiba, A., Solving surgical cases assignment problem by a branch-and-price approach. Int. J. Prod. Econ. 112:96–108, 2008.CrossRef

12.

Fisher, R. A., The design of experiments. Hafner Publishing Company, New York, 1960.

13.

Guinet, A., and Chaabane, S., Operating theatre planning. Int. J. Prod. Econ. 85:69–81, 2003.CrossRef

14.

Jebali, A., Alouane, A., and Ladet, P., Operating rooms scheduling. Int. J. Prod. Econ. 99:52–62, 2006.CrossRef

15.

Lindo Systems., Accessed October 09, 2010 from http://www.lindo.com, 2010.

16.

Kharraja, S., Chaabane, S., and Marcon, E., Evaluation de performances pour deux stratégies de programmation opératoire de bloc. In: Actes de la 2 ^eme Conf Int Francophone d’Automatique, Nantes, France, 2002.

17.

NIST/SEMATECH e-Handbook of Statistical Methods. Accessed October 09, 2010 from http://www.itl.nist.gov/div898/handbook/.

18.

Ross, P., Taguchi techniques for quality engineering. McGraw Hill, NewYork, 1996.

19.

Shmitz, H., and Kwak, N., Monte Carlo simulation of operating-room and recovery-room usage. Oper. Res. 20:1171–1180, 1972.CrossRef

20.

Taguchi, G., Taguchi methods: Design of experiments. American Supplier Institute, Inc, Michigan, 1993.

21.

Tsoy, G., Arnaout, J-P., Smith, T., and Rabadi, G., A genetic algorithm approach for surgery operating rooms scheduling problem. In: Proceedings of the 25th National Conference of the American Society for Engineering Management, Alexandria, Virginia. 2004.

22.

Vissers, J., Patient flow-based allocation of inpatient resources: A case study. Eur. J. Oper. Res. 105:356–370, 1998.MATHCrossRef

23.

Weinbroum, A. A., Ekstein, P., and Ezri, T., Efficiency of the operating room suite. Am. J. Surg. 185:244–250, 2003.CrossRef

24.

Weng, M., Lu, J., and Ren, H., Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Econ. 70:215–226, 2001.CrossRef

Titel: ACO for the Surgical Cases Assignment Problem
verfasst von: Charbel Rizk
Jean-Paul Arnaout
Publikationsdatum: 01.06.2012
Verlag: Springer US
Erschienen in: Journal of Medical Systems / Ausgabe 3/2012
Print ISSN: 0148-5598
Elektronische ISSN: 1573-689X
DOI: https://doi.org/10.1007/s10916-010-9648-z

Springer Medizin

Abstract

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Weitere Artikel der Ausgabe 3/2012

Integrating Computerized Primitives and Annotated Video Patterns: A Proposed Model for Autism Diagnosis and Research

Barriers to Physicians’ Adoption of Healthcare Information Technology: An Empirical Study on Multiple Hospitals

Design and Development of EMR Supporting Medical Process Management

Singular Value Decomposition Based Feature Extraction Technique for Physiological Signal Analysis

Intelligent Analysis of Acute Bed Overflow in a Tertiary Hospital in Singapore

Thermography Based Breast Cancer Detection Using Texture Features and Support Vector Machine