Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorithm. A resource selection rule and strategy of overtime judging and adjusting was designed, and the scheduling process with the ant colony algorithm was realized. The case study shows that the improved ant colony algorithm proposed in this paper achieved good results in shortening total time and allocating resources for surgery scheduling. © 2012 Springer-Verlag.
CITATION STYLE
Yin, J., & Xiang, W. (2012). Ant colony algorithm for surgery scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 198–205). https://doi.org/10.1007/978-3-642-30976-2_24
Mendeley helps you to discover research relevant for your work.