Aco for the surgical cases assignment problem

Journal of Medical Systems

Volumn 36, Issue 3, 2012, Pages 1891-1899

  Rizk, Charbel ^a   Arnaout, Jean Paul ^a  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

Author keywords

Ant Colony Optimization; Integer program; Metaheuristic; Surgical cases assignment problem

Indexed keywords

ALGORITHM; ANT COLONY OPTIMIZATION ALGORITHM; ARTICLE; COMPARATIVE STUDY; HEALTH CARE INDUSTRY; SURGICAL PATIENT;

ALGORITHMS; APPOINTMENTS AND SCHEDULES; DECISION MAKING, COMPUTER-ASSISTED; EFFICIENCY, ORGANIZATIONAL; HUMANS; SURGERY DEPARTMENT, HOSPITAL;

EID: 84864047141     PISSN: 01485598     EISSN: 1573689X     Source Type: Journal    
DOI: 10.1007/s10916-010-9648-z     Document Type: Article

References (24)

1. ACOforSCAP., Accessed October 09, 2010 from http://sites.google.com/site/ jparnaout/acoforscap, 2010.
2. Arnaout, J.-P., Heuristics for the maximization of Operating Rooms utilization using Simulation. Simulation. 86:573-583, 2010.
3. 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.
4. Blake, J. T., and Donald, J., Mount Sinai hospital uses integerprogramming to allocate operating room time. Interfaces. 32 (2):63-73, 2002.
5. Cardoen, B., Demeulemeester, E., and Belien, J., Operating room planning and scheduling: A literature review. Eur. J. Oper. Res. 201:921-932, 2010.
6. Clergue, F., Gestion du bloc opératoire: Pourquoi une telle préoccupation? Informations cliniques en Anesthésie- Réanimation, 93-95, 1999.
7. 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. (Pubitemid 29293301)
8. 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.
9. 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. (Pubitemid 351179594)
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.
14. Jebali, A., Alouane, A., and Ladet, P., Operating rooms scheduling. Int. J. Prod. Econ. 99:52-62, 2006. (Pubitemid 41550210)
15. Lindo Systems., Accessed October 09, 2010 from http://www.lindo.com, 2010.
16. 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 operatingroom and recovery-room usage. Oper. Res. 20:1171-1180, 1972.
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. (Pubitemid 128387786)
23. Weinbroum, A. A., Ekstein, P., and Ezri, T., Efficiency of the operating room suite. Am. J. Surg. 185:244-250, 2003. (Pubitemid 36298891)
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. (Pubitemid 32272150)