NDLI: Policies and decision models for solving elective case Operating Room scheduling

Content Provider	IEEE Xplore Digital Library
Author	Pariente, J.M.M. Torres, J.M.F. Cia, T.G.
Copyright Year	2009
Description	Author affiliation: Plastic Surgery Unit, University Hospital Virgen del Rocio, Av. Manuel Siurot s/n. 41013, Spain (Cia, T.G.) \|\| Industrial Management, School of Engineering. University of Seville. Camino de los Descubrimientos s/n. 41092, Spain (Pariente, J.M.M.; Torres, J.M.F.)
Abstract	Surgical cases constitute one of the most important activities in a hospital both from social and economics point of view. The most expensive facility involved in the surgical process is the Operating Room (OR), as it consumes between 10–15% of the budget in a hospital. Therefore, adequate decision-making for planning and scheduling ORs is of vital importance. This process can be decomposed in three phases: session panning problem (SPP), master surgical schedule (MSS) and elective case scheduling (ECS). In this paper, we focus on ECS, which serves to assign dates for surgery to all patients in the surgical unit's waiting list. In our model, patients must be operated before an exogenous deadline, while taking into account the different availability of surgeons. For this problem, we have developed a mixed integer programming model. We analyse two different policies corresponding to different surgical service models. In the P-S-OR policy, patients are first assigned to a surgeon and subsequently the set “patient-surgeon” is allocated to an OR shift. In the P-OR-S policy, patients are first assigned to an OR shift, and later a surgeon is assigned to each OR shift in the planning horizon. These two policies are tested using real surgical data from a surgical unit in a Spanish hospital. The results yielded by the P-OR-S policy suggest the latter to be more flexible than P-S-OR, as the patient doesn't have assigned a surgeon and therefore he/she does not depend on the surgeon's availability.
Starting Page	112
Ending Page	117
File Size	1535687
Page Count	6
File Format	PDF
ISBN	9781424441358
DOI	10.1109/ICCIE.2009.5223538
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-07-06
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Job shop scheduling Costs Decision making Linear programming Mixed integer programming Scheduling Surges Hospitals Engineering management Surgery Operating room Plastics Testing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Ranking the solution techniques for reactive scheduling problem in operating room

A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem

Using mixed integer programming to schedule it change requests

Application of integer programming for solving crew scheduling problem in Taipei Rapid Transit Corporation

Solving Nurse Scheduling Problem by Integer-Programming-Based Local Search

Mixed Integer Programming model for flexible job-shop scheduling problem (FJSP) to minimize makespan and total machining time

Simulation of a Multiple Operating Room Surgical Suite

Operating room planning and scheduling: solving a surgical case sequencing problem

Optimal surgical scheduling based on Branch-and-Price

Policies and decision models for solving elective case Operating Room scheduling

Similar Documents

Ranking the solution techniques for reactive scheduling problem in operating room

A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem

Using mixed integer programming to schedule it change requests

Application of integer programming for solving crew scheduling problem in Taipei Rapid Transit Corporation

Solving Nurse Scheduling Problem by Integer-Programming-Based Local Search

Mixed Integer Programming model for flexible job-shop scheduling problem (FJSP) to minimize makespan and total machining time

Simulation of a Multiple Operating Room Surgical Suite

Operating room planning and scheduling: solving a surgical case sequencing problem

Optimal surgical scheduling based on Branch-and-Price

Policies and decision models for solving elective case Operating Room scheduling