Abstract
This paper addresses surgical scheduling problem in a decentralized environment where the availability of surgeons is considered as their private information. In addition to combinatorial complexities inherited from centralized surgical scheduling models, strategic behaviors of surgeons derived from decentralized game theoretic environments have to be addressed. We propose an iterative auction mechanism, a form of decentralized combinatorial optimization, for solving the surgical scheduling problem. The eligibility restriction of operation rooms is also considered. The objective is to maximize the overall social welfare of patients which is represented by the overall weights of surgeries scheduled. Under the proposed mechanism, we prescribe strategies for surgeons on submitting their availability information to maximize their preference values, and at the same time, minimize the revelation of their private information. We prove that myopic bidding strategy is a weakly dominant strategy for surgeons under the proposed scheduling mechanism and the solution quality is an non-decreasing function of the number of bidding rounds along the bidding process. We also present a nontrivial worked example to illustrate the application of the proposed approach in surgical scheduling setting.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cardoen B, Demeulemeester E, Beliën J (2010) Operating room planning and scheduling: a literature review. Eur J Oper Res 201:921–932
Glouberman S, Mintzberg H (2001) Managing the care of health and the cure of disease part I: differentiation. Health Care Manag Rev 26:56–59
Gu YH, Goh M, Chen QL, Souza RD, Tang GC (2013a) A new two-party bargaining mechanism. J Comb Optim 25(1):135–163
Gu Y, Fan J, Tang G, Zhong J (2013b) Maximum latency scheduling problem on two-person cooperative games. J Comb Optim 1–11
Jules G, Saadat M, (2016) Agent Cooperation Mechanism for Decentralized Manufacturing Scheduling. In: IEEE transactions on systems, man, cybernetics systems
Liu L, Tang G, Fan B, Wang X (2015) Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process. J Comb Optim 30:938–948
McFadden DW, Tsai M, Kadry B, Souba WW (2012) Game theory: applications for surgeons and the operating room environment. Surgery 152:915–922
Meskens N, David D, Arnauld H (2013) Multi-objective operating room scheduling considering desiderata of the surgical team. Decis Support Syst 55:650–659
Monteiro T, Meskens N, Wang T (2015) Surgical scheduling with antagonistic human resource objectives. Int J Prod Res 53:7434–7449
Nisan N (2006) Bidding languages for combinatorial auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions. MIT Press, Cambridge
Samudra M, Van Riet C, Demeulemeester E, Cardoen B, Vansteenkiste N, Rademakers FE (2016) Scheduling operating roomsachievements, challenges and pitfalls. J Schedul 19(5):493–525
Santibáñez P, Begen M, Atkins D (2007) Surgical block scheduling in a system of hospitals: an application to resource and wait list management in a British Columbia health authority. Health Care Manag Sci 10:269–282
van Oostrum JM, Van Houdenhoven M, Hurink JL, Hans EW, Wullink G, Kazemier G (2008) A master surgical scheduling approach for cyclic scheduling in operating room departments. OR Spectr 30:355–374
Vancroonenburg W, Smet P, Berghe GV (2015) A two-phase heuristic approach to multi-day surgical case scheduling considering generalized resource constraints. Oper Res Health Care 7:27–39
Wang C, Wang Z, Ghenniwa HH, Shen W (2011) Due-date management through iterative bidding. IEEE Trans Syst Man Cybern A 41(6):1182–1198
Wang C, Dargahi F, Bhuiyan MFH (2012) On the tradeoff between privacy and efficiency: a bidding mechanism for scheduling non-commercial services. Comput Ind 63:610–618
Wang T, Meskens N, Duvivier D (2015a) Scheduling operating theatres: mixed integer programming versus constraint programming. Eur J Oper Res 247:401–413
Wang D, Liu F, Yin Y, Wang J, Wang Y (2015b) Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period. J Comb Optim 30:967–981
Wang S, Su HQ, Wan GH (2015c) Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling. J Comb Optim 30:982–995
Yang Y, Shen B, Gao W, Liu Y, Zhong L (2015) A surgical scheduling method considering surgeons’ preferences. J Comb Optim 30:1016–1026
Zhong L, Luo S, Wu L, Xu L, Yang J, Tang G (2014) A two-stage approach for surgery scheduling. J Comb Optim 27:545–556
Zonderland ME, Timmer J (2012) Optimal allocation of MRI scan capacity among competing hospital departments. Eur J Oper Res 219:630–637
Acknowledgements
This research was supported by the National Natural Science Foundation of China (71672019, 71271039), New Century Excellent Talents in University NCET-13-0082 and China Scholarship Council.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, L., Wang, C. & Wang, J. A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information. J Comb Optim 37, 405–417 (2019). https://doi.org/10.1007/s10878-017-0247-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-017-0247-5