Surgery sequencing to minimize the expected maximum waiting time of emergent patients

Vandenberghe, Mathieu; Vuyst, Stijn De; Aghezzaf, El‐Houssaine; Bruneel, Herwig

doi:10.1016/j.ejor.2018.11.073

Cited by 19 publications

(6 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach is introduced by van Essen et al [14]. Vandenberghe et al extended the BIMs approach for the case that surgeries durations are stochastic with known distributions [15]. Duma and Aringhieri also use the BIMs approach in their paper [16].…”

Section: Various or Capacity Planningmentioning

confidence: 99%

Efficient scheduling of emergency surgeries by adjusting the schedule of elective surgeries

et al. 2021

View full text Add to dashboard Cite

The rapid growth of the population has resulted in an increasing demand for healthcare services, which forces managers to use costly resources such as operating rooms effectively. The surgery-scheduling problem is a general title for problems that consists of the patient selection and sequencing of the surgeries at the operational level, setting their start times, and assigning the resources. Hospital managers usually encounter elective surgeries that can be delayed slightly and emergency surgeries whose arrivals are unexpected, and most of them need quick access to operating rooms. Reserving operating room capacity for handling incoming emergency surgeries is expensive.Moreover, emergency surgeries cannot afford long waiting times. This paper deals with the problem of surgery scheduling in the presence of emergency surgeries with a focus on balancing the efficient use of operating room capacity and responsiveness to emergency surgeries. We proposed a new algorithm for surgery scheduling with a specific operating room capacity planning and analyzed it through a simulation method based on real data. This algorithm respects working hours and availability of staff and other resources in a surgical suite.

show abstract

Section: Various or Capacity Planningmentioning

confidence: 99%

Efficient scheduling of emergency surgeries by adjusting the schedule of elective surgeries

et al. 2021

View full text Add to dashboard Cite

show abstract

“…In a few papers, another approach for flexible OR policy is implemented, in such a way that emergency surgery can be inserted into the schedule in slack times or instead of one of the current scheduled elective surgeries.These opportunities for inserting emergencies are known as the Break-in-Moments (BIMs) [20,21]. A special case of implementing the BIMs approach, when each surgery has a stochastic duration with known distribution was studied by Vandenberghe et al [22].…”

Section: Introductionmentioning

confidence: 99%

A Mathematical Model for Scheduling Elective Surgeries for Minimizing the Waiting Times in Emergency Surgeries

Yazdi

Zandieh

Haleh

2020

IJE

View full text Add to dashboard Cite

The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that are admitted before the planning horizon of the schedule and emergency surgeries that arrive during this horizon and require fast services. In this paper, we presented a mathematical model for scheduling electives and emergencies. In our model, we considered surgeries as projects with multi-activities. We implemented the Break-in-Moments (BIMs) technique in this structure, which to our best knowledge has not been implemented in the literature before. We examined this method with real data from a medium-sized Norwegian hospital and observed that this method reduces the waiting time of emergencies to be inserted into the schedule without dedicating any OR merely to emergencies. In such a way, this method counterbalances between efficient OR usage and responsiveness for emergency surgeries.

show abstract

“…This leads BIM to have a novel scheduling objective: minimizing the expected maximum time between these potential 'break-in-moments'. We have focused on solving the more general case where surgery durations are stochastic but emergency arrivals are unknown: the Stochastic Break-In-Moment (SBIM) Problem [3].…”

Section: Introductionmentioning

confidence: 99%

“…Minimizing this worst-case risk is equivalent to trying to create a schedule where completion times are uniformly spread. This means we should be able to re-use our solution methods [3] in the context of the sensitive queue process we outlined above. However there is one major difference: the standard assumption for SBIM is that tasks are preassigned to machines.…”

Section: Introductionmentioning

confidence: 99%

Protecting a Sensitive Queue from Arrival Variability

Vandenberghe

Vuyst

Aghezzaf

et al. 2018

2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

Self Cite

View full text Add to dashboard Cite

Minimizing item waiting time between stages is a general focus of operations research, and of particular concern for certain industries. We propose a two-stage production system where, to minimize the waiting time before stage 2, we focus on spreading the completion times of the stage 1 machines across the available interval. We contrast this objective with a similar problem defined in a healthcare context, but that has an assumption of fixed assignment. We obtain insights in the added value that free assignment can provide, by comparing the solutions of a local search method for assignment, with those of a reference case where assignment is fixed. Computational results show that this added value is highest in cases where task means differ insufficiently to be ordered effectively, and where task distributions have low variance. For the discussed instances, significant reductions in item waiting times can be achieved while making minimal concessions on expected makespan.

show abstract

Surgery sequencing to minimize the expected maximum waiting time of emergent patients

Cited by 19 publications

References 29 publications

Efficient scheduling of emergency surgeries by adjusting the schedule of elective surgeries

Efficient scheduling of emergency surgeries by adjusting the schedule of elective surgeries

A Mathematical Model for Scheduling Elective Surgeries for Minimizing the Waiting Times in Emergency Surgeries

Protecting a Sensitive Queue from Arrival Variability

Contact Info

Product

Resources

About