Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/6739
Title: An optimization based on simulation approach to the patient admission scheduling problem using a linear programing algorithm
Authors: Granja,C
Bernardo Almada-Lobo
Janela,F
Seabra,J
Adélio Mendes
Issue Date: 2014
Abstract: Background: As patient's length of stay in waiting lists increases, governments are looking for strategies to control the problem. Agreements were created with private providers to diminish the workload in the public sector. However, the growth of the private sector is not following the demand for care. Given this context, new management strategies have to be considered in order to minimize patient length of stay in waiting lists while reducing the costs and increasing (or at least maintaining) the quality of care. Method: Appointment scheduling systems are today known to be proficient in the optimization of health care services. Their utilization is focused on increasing the usage of human resources, medical equipment and reducing the patient waiting times. In this paper, a simulation-based optimization approach to the Patient Admission Scheduling Problem is presented. Modeling tools and simulation techniques are used in the optimization of a diagnostic imaging department. Results: The proposed techniques have demonstrated to be effective in the evaluation of diagnostic imaging workflows. A simulated annealing algorithm was used to optimize the patient admission sequence towards minimizing the total completion and total waiting of patients. The obtained results showed average reductions of 5% on the total completion and 38% on the patients' total waiting time.
URI: http://repositorio.inesctec.pt/handle/123456789/6739
http://dx.doi.org/10.1016/j.jbi.2014.08.007
metadata.dc.type: article
Publication
Appears in Collections:CEGI - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00A-2H8.pdf
  Restricted Access
1.26 MBAdobe PDFView/Open Request a copy


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