Surgical case scheduling as a generalized job shop scheduling problem

By Dinh-Nguyen Pham, Andreas Klinkert. European Journal of Operational Research, 2008

390 citations recorded by the source corpus.

Surgical case scheduling allocates hospital resources to individual surgical cases and decides on the time to perform the surgeries. This task plays a decisive role in utilizing hospital resources efficiently while ensuring quality of care for patients. This paper proposes a new surgical case scheduling approach which uses a novel extension of the Job Shop scheduling problem called multi-mode blocking job shop (MMBJS). It formulates the MMBJS as a mixed integer linear programming (MILP) problem and discusses the use of the MMBJS model for scheduling elective and add-on cases. The model is illustrated by a detailed example, and preliminary computational experiments with the CPLEX solver on practical-sized instances are reported.

Subfields: Emergency Medical Services, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/e9cf316af9be6d20671fee2b00c0cff0d34439ad

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Emergency Medical Services

1. Abdur Rais
2. Ana Viana
3. Brecht Cardoen
4. Erik L. Demeulemeester
5. Jeroen Beliën

In Industrial and Manufacturing Engineering

1. Abdur Rais
2. Ana Viana
3. Brecht Cardoen
4. Erik L. Demeulemeester
5. Jeroen Beliën

Citations in the corpus

• Operating room planning and scheduling: A literature review (2010, background): “Pham and Klinkert [98], for instance, incorporate all but demand-related constraints in their surgical case scheduling problem.”
• Operations Research in Healthcare: a survey (2011, background): “Rahman and Smith (1999) addressed the problem of finding additional suitable sites for healthcare facilities in rural areas and modelled the problem as a maximal covering location model.”