A patient assignment algorithm for home care services

Journal of the Operational Research Society

Volumn 60, Issue 4, 2009, Pages 481-495

  Hertz, A ^a   Lahrichi, N ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

NURSING; TABU SEARCH;

DEMAND FLUCTUATIONS; HOME-CARE SERVICES; MIXED INTEGER PROGRAMMING MODEL; MIXED-INTEGER PROGRAMS; NON-LINEAR CONSTRAINTS; OPERATIONAL RESEARCH; PATIENT ASSIGNMENTS; TABU SEARCH ALGORITHMS;

INTEGER PROGRAMMING;

EID: 62349135784     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602574     Document Type: Article

References (19)

1. Bérubé JF, Gendreau M and Potvin JY (2006). A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Cahier du CRT 2006-30. Centre de Recherche sur les Transports, Montreal, Canada.
2. Blais M, Lapierre SD and Laporte G (2003). Solving a homecare districting problem in an urban setting. J Opl Res Soc 54: 1141-1147.
3. Burke EK, De Causmaecker P, Vanden Berghe G and Van Landeghem H (2004). The state of the art of nurse rostering. J Scheduling 7: 441-499.
4. Chu S, Huang T and Lee L (2004). Improving workload balance and code optimization on processor-in-memory systems. J Syst Software 71: 71-82.
5. Ferland JA, Hertz A and Lavoie A (1996). An objectoriented methodology for solving assignment-type problems with neighborhood search techniques. Opns Res 44: 347-359.
6. Gavish B and Pirkul H (1991). Algorithms for the multi-resource generalized assignment problem. Mngt Sci 37: 695-713.
7. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston.
8. Hébert R and Dubuc N (2001). Les profils ISO-SMAF: Un système de gestion clinico-administratif pour la planification des services de longue durée dans un système de soins intégrés. Research Report. Centre d'Expertise en Santé de Sherbrooke, Canada.
9. Hughes M (1999). Nursing workload: An unquantifiable entity. J Nursing Mngt 7: 317-322.
10. Ibaraki T, Nonobe K and Yagiura M (2005). Metaheuristics: Progress as Real Problem Solvers. Springer: New York.
11. Laguna M, Kelly JP, Gonzàlez-Velarde JL and Glover F (1995). Tabu search for the multilevel generalized assignment problem. Eur J Opl Res 82: 176-189.
12. Lahrichi N, Lapierre SD, Hertz A, Talib A and Bouvier L (2006). Analysis of a territorial approach to the delivery of nursing home care services based on historical data. J Med Syst 30: 283-291.
13. Martello S and Toth P (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley: New York.
14. Mazzola JB and Wilcox SP (2001). Heuristics for the multi-resource generalized assignment problem. Naval Res Logist 48: 468-483.
15. Ministère de la Santé et des Services Sociaux (2004). Local services networks, http://www.msss.gouv.qc.ca/en/reseau/lsn.php.
16. Mullinax C and Lawley M (2002). Assigning patients to nurses in neonatal intensive care. J Opl Res Soc 53: 25-35.
17. Riezebos J, Korte GJ and Land MJ (2003). Improving a practical DBR buffering approach using workload control. Int J Prod Res 41: 699-712.
18. Yagiura M, Iwasaki S, Ibaraki T and Glover F (2004). A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Disc Optim 1: 87-98.
19. Zhuang Y, Liang TY, Shieh C, Lee J and Yang L (2004). A groupbased load balance scheme for software distributed shared memory systems. J Supercomputing 28: 295-309.