Skip to main content
Springer Nature Link
Log in

A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

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

    Article  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

  • Gu YH, Goh M, Chen QL, Souza RD, Tang GC (2013a) A new two-party bargaining mechanism. J Comb Optim 25(1):135–163

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • McFadden DW, Tsai M, Kadry B, Souba WW (2012) Game theory: applications for surgeons and the operating room environment. Surgery 152:915–922

    Article  Google Scholar 

  • Meskens N, David D, Arnauld H (2013) Multi-objective operating room scheduling considering desiderata of the surgical team. Decis Support Syst 55:650–659

    Article  Google Scholar 

  • Monteiro T, Meskens N, Wang T (2015) Surgical scheduling with antagonistic human resource objectives. Int J Prod Res 53:7434–7449

    Article  Google Scholar 

  • Nisan N (2006) Bidding languages for combinatorial auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions. MIT Press, Cambridge

    Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Wang T, Meskens N, Duvivier D (2015a) Scheduling operating theatres: mixed integer programming versus constraint programming. Eur J Oper Res 247:401–413

    Article  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • Yang Y, Shen B, Gao W, Liu Y, Zhong L (2015) A surgical scheduling method considering surgeons’ preferences. J Comb Optim 30:1016–1026

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • Zonderland ME, Timmer J (2012) Optimal allocation of MRI scan capacity among competing hospital departments. Eur J Oper Res 219:630–637

    Article  MathSciNet  MATH  Google Scholar 

Download references

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

  1. Faculty of Management and Economics, Dalian University of Technology, Dalian, 116024, People’s Republic of China

    Lu Liu & Jianjun Wang

  2. Concordia Institute for Information Systems Engineering, Concordia University, Montreal, H3G 1M8, Canada

    Lu Liu & Chun Wang

Authors
  1. Lu Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chun Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jianjun Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jianjun Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0247-5

Keywords