Homogeneous population solving the minimal perturbation problem in dynamic scheduling of surgeries

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Instituto Mexicano del Seguro Social (IMSS) is the federal government medical institution with many hospitals around the country. Usually, the surgical operating areas within hospitals are constantly requested for emergency surgerieswhich trigger continuous changes in the established schedule, and having an effect in other factors such as doctors, nurses and patients, as well. In this paper, we tackle this type of dynamic scheduling problem with minimal perturbation by using and comparing two types of approaches: A Segmentation-based heuristic and a Genetic-Algorithm-based schema. The GA-based model which includes homogenous population (GA-HPop) obtains the best performance when tested with a set of real instances. It gets the best characteristics of Genetic Algorithm and adding changes, ensuring a new solution as possible close to original solution. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Peŕez-López, A., Baltazar, R., Carpio, M., Terashima-Marin, H., Magaña-Lozano, D. J., & Puga, H. J. (2013). Homogeneous population solving the minimal perturbation problem in dynamic scheduling of surgeries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8265 LNAI, pp. 473–484). https://doi.org/10.1007/978-3-642-45114-0_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free