Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling

Roshanaei, Vahid; Luong, Curtiss; Aleman, Dionne M.; Urbach, David R.

doi:10.1016/j.ejor.2016.08.024

Cited by 80 publications

(32 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An aggregated approach is followed in which patients' therapy jobs or surgeries are assigned to start times. This approach is similar to Schimmelpfeng et al (2012), Griffiths et al (2012), Roshanaei et al (2017a) and Roshanaei et al (2017b).…”

Section: Related Workmentioning

confidence: 77%

“…The difference with our work is, however, that their algorithm checks infeasibilities based on the multidimensional knapsack problem whereas we check individual therapists' routes. Roshanaei et al (2017a) and Roshanaei et al (2017b) focus on multi-hospital surgical case scheduling for operating rooms. The authors model the problem using Integer Programming and use a logic-based Benders' method to solve it.…”

Section: Related Workmentioning

confidence: 99%

“…Thirdly, with respect to the constraints, the model combines the approaches of Schimmelpfeng et al (2012) and Griffiths et al (2012) by considering a number of real-world constraints such as precedence constraints, time windows, breaks for therapists and preferences of patients. Finally, with respect to the solution approach, Roshanaei et al (2017a) and Roshanaei et al (2017b) are most relevant because of the cutting planes applied to the mathematical program while in our problem, the application area is different and we have both a routing and a scheduling problem.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Hospital-wide therapist scheduling and routing: Exact and heuristic methods

Gärtner

Frey

Kolisch

2018

IISE Transactions on Healthcare Systems Engineering

View full text Add to dashboard Cite

In this paper, we address the problem of scheduling and routing physical therapists hospital-wide. At the beginning of a day, therapy jobs are known to a hospital's physical therapy scheduler who decides for each therapy job when, where and by which therapist a job is performed. If a therapist is assigned to a sequence which contains two consecutive jobs that must take place in different treatment rooms, then transfer times must be considered. We propose three approaches to solve the problem. First, an Integer Program (IP) simultaneously schedules therapies and routes therapists. Second, a cutting plane algorithm iteratively solves the therapy scheduling problem without routing constraints and adds cuts to exclude schedules which have no feasible routes. Since hospitals are interested in obtaining quick solutions, we also propose a heuristic algorithm, which schedules therapies sequentially by simultaneously checking routing and resource constraints. Using real-world data from a hospital, we compare the performance of the three approaches. Our computational analysis reveals that our IP formulation fails to solve test instances, which have more than 30 jobs, to optimality in an acceptable solution time. In contrast, the cutting plane algorithm can solve instances with more than 100 jobs optimally. The heuristic approach obtains good solutions for large real-world instances within fractions of a second.

show abstract

Section: Related Workmentioning

confidence: 77%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Hospital-wide therapist scheduling and routing: Exact and heuristic methods

Gärtner

Frey

Kolisch

2018

IISE Transactions on Healthcare Systems Engineering

View full text Add to dashboard Cite

show abstract

“…This cut is modelled in a MIP formulation as in Inequality (4.58) and in a CP formulation as in Inequality (4.59). The optimality cut has been proved to be valid in previous work [58].…”

Section: Benders Cutmentioning

confidence: 96%

Modelling and Solving the Senior Transportation Problem

Liu

Aleman

Beck

2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

As the Canadian population ages, there is an increasing demand for senior transportation services that cannot be met by regular public transportation systems. This thesis aims to bring attention to the combinatorial optimization problem of senior transportation. By extending current vehicle routing problem knowledge and computational technologies, we construct novel problem definitions for the Senior Transportation Problem (STP) and the Senior Transportation Problem with Overbooking (STPOB) based on data provided by a partnering non-profit organization specializing in senior transportation services. Solution approaches including mixed integer programming, constraint programming, two logicbased Benders decompositions and a construction heuristic are developed and empirical analyses on both randomly generated datasets and real-life datasets are performed. Constraint programming demonstrates best results being able to solve to optimality large real-life instances of up to 270 vehicles with 385 requests for the STP and up to 210 vehicles with 320 requests for the STPOB under 600 seconds. This thesis would not have been possible without a number of people. I would like to use this space to express my gratitude towards them. Before all, I would like thank my supervisors Professor J. Christopher Beck and Professor Dionne M. Aleman for the boundless guidance, patience, support, as well as all the creative ideas throughout the past few years. Their persistence has inspired and pushed me to places and opportunities that I could not even have imagined previously. Not only have they advised me on technical expertise, they have shown me how interesting and fun research can be. I could not have imagined better mentors for my studies and research. I would like to thank my committee members, Professor Merve Bodur and Professor Chi-Guhn Lee for their time and feedback. Thanks to all the amazing people at TIDEL and morLAB for such a fun and amazing time that I would never forget in my life. They have made the sometimes dull student life shine in bright colours. Thanks to my parents for the unconditional love and support for me to pursue my dreams. Lastly, to Chong, my best friend and beloved husband, thank you for being always by my side to share the bitterness, keep me sane and make me laugh.

show abstract

“…Lately, Marchesi and Pacheco (2016) have used a genetic algorithm to solve the master surgical schedule problem while Hancerliogullari et al (2016) use simulated annealing to generate the schedules for a set of ORs. Two quite different approaches can be found in Roshanaei et al (2017) and Castro and Marques (2015). In Roshanaei et al (2017) they use logic-based Benders' decomposition to schedule a distributed set of ORs across a network of hospitals while Castro and Marques (2015) use generalised disjunctive programming for the room scheduling problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Planning and scheduling operating rooms for elective and emergency surgeries with uncertain duration

Kroer

Foverskov

Vilhelmsen

et al. 2018

Operations Research for Health Care

View full text Add to dashboard Cite

 Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling

Cited by 80 publications

References 46 publications

Hospital-wide therapist scheduling and routing: Exact and heuristic methods

Hospital-wide therapist scheduling and routing: Exact and heuristic methods

Modelling and Solving the Senior Transportation Problem

Planning and scheduling operating rooms for elective and emergency surgeries with uncertain duration

Contact Info

Product

Resources

About