MRI reservation for neurovascular patients

Authors:
Na Geng;Vincent Augusto;Xiaolan Xie;Zhibin Jiang
Affiliations:
Ecole Nationale Superieure des Mines de Saint Etienne and Shanghai Jiao Tong University;Ecole Nationale Superieure des Mines de Saint Etienne, Engineering and Health Division and IFRESIS 143 - INSERM, Saint-Etienne cedex 2, France;Ecole Nationale Superieure des Mines de Saint Etienne, Engineering and Health Division and IFRESIS 143 - INSERM, Saint-Etienne cedex 2, France;Shanghai Jiao Tong University, Industrial Engineering and Logistics Management Department, Shanghai, China
Venue:
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Year:
2009

Citing 3
Cited 0

Project and process improvements in healthcare organizations: a simulation study of the radiology department at JMH

Proceedings of the 32nd conference on Winter simulation
Managing Patient Service in a Diagnostic Medical Facility

Operations Research
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quick diagnosis is critical for neurovascular patients. Diagnosis of these patients needs the assistance of expensive and heavily used imaging equipment. This results in long waiting time which potentially threats patient's life. It is clearly very important for the neurovascular department to improve the service level by reducing the waiting time. To deal with this problem, this paper proposes a new reservation process between the neurovascular department and the imaging department. The neurovascular department reserves a certain number of time slots in advance for the imaging techniques, i.e., magnetic resonance imaging (MRI). This ensures that the stroke patients can receive the examination more quickly. This problem is formulated as a stochastic programming model in order to reach the best comprise between patient waiting time and unused time slots. To solve this problem, a two-step Monte Carlo approach is proposed. The problem is first approximated by a deterministic Monte Carlo optimization problem. It is further simplified to determine the contract. Given the contract, we then propose a feasible control policy. Numerical results show that the contract and the control policy proposed in this paper are quite efficient.