Abstract

Surgery scheduling under upstream and downstream resource constraints was described as a three-stage multi-resource constrained flexible flow-shop scheduling problem in this study and an optimization approach based on ant colony algorithm was proposed for obtaining an optimal surgery schedule with respect to minimizing the makespan. A resource selection rule and strategy of overtime judging and adjusting was designed to allocate the resources reasonably and to make the scheduling results closer to reality. Compared to actual scheduling, the computerized result shows that the improved ant colony algorithm proposed in this paper achieved good results in shortening total time and allocating resources for surgery scheduling.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.