Scheduling healthcare services in a home healthcare system / Y.-J. An in Journal of the operational research society (JORS), Vol. 63 N° 11 (Novembre 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 11 (Novembre 2012) . - pp. 1589–1599 Titre : Scheduling healthcare services in a home healthcare system Type de document : texte imprimé Auteurs : Y.-J. An, Auteur ; Y.-D. Kim, Auteur ; B. J. Jeong, Auteur Année de publication : 2012 Article en page(s) : pp. 1589–1599 Note générale : operational research Langues : Anglais (eng) Mots-clés : home healthcare management  scheduling  heuristic Index. décimale : 001.424 Résumé : We consider a scheduling problem in a home healthcare system in which nurses visit patients regularly for relatively minor healthcare services. Intervals between the visits may differ for different patients. On each day in the planning horizon, a nurse must visit the patients assigned to her/him on that day, and then return to the hospital. For the problem of determining the visiting schedule with the objective of minimizing total travel time of the nurse over the planning horizon, we develop a two-phase heuristic algorithm. To evaluate performance of the proposed algorithm, a series of computational tests is performed on a number of randomly generated problem instances and a real instance. Results of the tests show that the heuristic algorithm gives near optimal solutions for problems of practical sizes in a reasonable time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n11/abs/jors2011153a.html [article] Scheduling healthcare services in a home healthcare system [texte imprimé] / Y.-J. An, Auteur ; Y.-D. Kim, Auteur ; B. J. Jeong, Auteur . - 2012 . - pp. 1589–1599. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 11 (Novembre 2012) . - pp. 1589–1599 Mots-clés : home healthcare management  scheduling  heuristic Index. décimale : 001.424 Résumé : We consider a scheduling problem in a home healthcare system in which nurses visit patients regularly for relatively minor healthcare services. Intervals between the visits may differ for different patients. On each day in the planning horizon, a nurse must visit the patients assigned to her/him on that day, and then return to the hospital. For the problem of determining the visiting schedule with the objective of minimizing total travel time of the nurse over the planning horizon, we develop a two-phase heuristic algorithm. To evaluate performance of the proposed algorithm, a series of computational tests is performed on a number of randomly generated problem instances and a real instance. Results of the tests show that the heuristic algorithm gives near optimal solutions for problems of practical sizes in a reasonable time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n11/abs/jors2011153a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire