Surgery Rescheduling Based on Pareto Solution Set Under Uncertain Resource
Tian-yong He () and
Wei Xiang
Additional contact information
Tian-yong He: Ningbo University
Wei Xiang: Ningbo University
A chapter in Proceedings of 20th International Conference on Industrial Engineering and Engineering Management, 2013, pp 389-397 from Springer
Abstract:
Abstract Most of surgery scheduling researches in the literature deal with the optimal surgery sequencing associated with qualified resources under deterministic resources. But there always exist some unexpected unavailability of resources in actual scheduling in hospital, such as absence of nurse and anesthetist or unavailability of facility, etc. In this situation, the original scheduling becomes infeasible. In this paper, we propose a modified ant colony algorithm based on Pareto set for multi-objective surgery rescheduling under unexpected uncertainty resource. The surgeons in surgery rescheduling are set to be consistent with the original scheduling, and the deviation of the starting time between original scheduling and rescheduling is further set to be minimized. The computational result show that our re-scheduling algorithm can achieve a satisfied solution with several measurements.
Keywords: Deviation; Multi-Object; Pareto; Uncertainty (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-40063-6_39
Ordering information: This item can be ordered from
http://www.springer.com/9783642400636
DOI: 10.1007/978-3-642-40063-6_39
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().