The operating room scheduling problem based on patient priority

Mashkani, O; Hwang, FJ; Salehipour, A

The operating room scheduling problem based on patient priority

Mashkani, O

Hwang, FJ Salehipour, A

Permalink

Publisher:: Springer
Publication Type:: Conference Proceeding
Citation:: Data and Decision Sciences in Action 2, 2021, pp. 144-166
Issue Date:: 2021

Closed Access

	Filename	Description	Size
	Mashkani2021_Chapter_TheOperatingRoomSchedulingProb.pdf	Published version	191.78 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mashkani, O https://orcid.org/0000-0003-1910-1170
dc.contributor.author	Hwang, FJ
dc.contributor.author	Salehipour, A
dc.date	2018-12-04
dc.date.accessioned	2022-05-15T04:42:44Z
dc.date.available	2018-12-04
dc.date.available	2022-05-15T04:42:44Z
dc.date.issued	2021
dc.identifier.citation	Data and Decision Sciences in Action 2, 2021, pp. 144-166
dc.identifier.isbn	978-3-030-60134-8
dc.identifier.issn	2198-0780
dc.identifier.issn	2198-0780
dc.identifier.uri	http://hdl.handle.net/10453/157364
dc.description.abstract	An efficient operating theatre schedule contributes significantly to enhancing the efficiency of hospital operation management and plays a critical financial role in most hospital settings. In this paper, an operating room scheduling problem based on patient priority is investigated at tactical and operational levels subject to specific strategic decisions. At the tactical level, the main goal is to generate a cyclic time table, known as the master surgical schedule (MSS) and can be repeated over the planning horizon of several months to years. Operational level concerns about allocating patients to operating rooms and determining the day of surgeries, which is called the surgical case assignment problem (SCAP). To handle the problems at both decision levels simultaneously, known as the MSS-SCAP problem, an integer linear programming (ILP) model, called MSS-SCAP model, and a heuristic approach are proposed. The objective function is to maximize the total priority scores of the patients assigned to the surgical scheduling blocks over a given planning horizon. An adaptive ILP model is also proposed to solve the SCAP, taking into consideration the dynamics of the waiting list. The computational experiments are conducted using a set of random data to evaluate the performance of the proposed MSS-SCAP model and heuristic algorithm, in terms of solution quality and computation time. Our numerical results indicate that the proposed ILP is capable of yielded optimal solutions for the small-scale instances and near-optimal solutions for medium-size instances within 3,600 seconds. The proposed heuristic algorithm can generate quality solutions within 2 seconds for large-scale instances.
dc.language	en
dc.publisher	Springer
dc.relation.ispartof	Data and Decision Sciences in Action 2
dc.relation.ispartof	Australian Society of Operations Research Conference
dc.relation.ispartofseries	Lecture Notes in Management and Industrial Engineering
dc.relation.isbasedon	10.1007/978-3-030-60135-5_11
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	The operating room scheduling problem based on patient priority
dc.type	Conference Proceeding
utslib.location.activity	Melbourne, Australia
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access	*
pubs.consider-herdc	true
dc.date.updated	2022-05-15T04:42:43Z
pubs.finish-date	2018-12-06
pubs.place-of-publication	Switzerland
pubs.publication-status	Published
pubs.start-date	2018-12-04
dc.location	Switzerland

Abstract:

An efficient operating theatre schedule contributes significantly to enhancing the efficiency of hospital operation management and plays a critical financial role in most hospital settings. In this paper, an operating room scheduling problem based on patient priority is investigated at tactical and operational levels subject to specific strategic decisions. At the tactical level, the main goal is to generate a cyclic time table, known as the master surgical schedule (MSS) and can be repeated over the planning horizon of several months to years. Operational level concerns about allocating patients to operating rooms and determining the day of surgeries, which is called the surgical case assignment problem (SCAP). To handle the problems at both decision levels simultaneously, known as the MSS-SCAP problem, an integer linear programming (ILP) model, called MSS-SCAP model, and a heuristic approach are proposed. The objective function is to maximize the total priority scores of the patients assigned to the surgical scheduling blocks over a given planning horizon. An adaptive ILP model is also proposed to solve the SCAP, taking into consideration the dynamics of the waiting list. The computational experiments are conducted using a set of random data to evaluate the performance of the proposed MSS-SCAP model and heuristic algorithm, in terms of solution quality and computation time. Our numerical results indicate that the proposed ILP is capable of yielded optimal solutions for the small-scale instances and near-optimal solutions for medium-size instances within 3,600 seconds. The proposed heuristic algorithm can generate quality solutions within 2 seconds for large-scale instances.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/157364