Publication type: Article in scientific journal
Type of review: Peer review (publication)
Title: Surgical case scheduling as a generalized job shop scheduling problem
Authors: Pham, Dinh-Nguyen
Klinkert, Andreas
DOI: 10.1016/j.ejor.2006.03.059
Published in: European Journal of Operational Research
Volume(Issue): 185
Issue: 3
Pages: 1011
Pages to: 1025
Issue Date: 2008
Publisher / Ed. Institution: Elsevier
ISSN: 0377-2217
Language: English
Subjects: Scheduling; Surgical case; Job shop; Operating room
Subject (DDC): 362: Health and social services
500: Natural sciences and mathematics
Abstract: 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.
Fulltext version: Published version
License (according to publishing contract): Licence according to publishing contract
Departement: School of Engineering
Organisational Unit: Institute of Data Analysis and Process Design (IDP)
Appears in Collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.