Activities Planning and Resource Assignment on Multi-place Hospital System - Exact and Approach Methods Adapted from the Bin Packing Problem

Michel Gourgand, Nathalie Grangeon, Nathalie Klement

Abstract

In France, the Hospital Community of Territory (HCT) has been defined since the settlement of the pricing by activity (T2A) in 2004, and the new governance. This new community allows the pooling of the hospital resources between any places in the same territory. It aims at increasing the continuity of healthcare. A medical exam needs human resources and one material resource, both of them compatible with the exam. Human resources are supposed available all the time. In this paper, material resources are the critical resources. The objective is to create a decision support tool which plans the exams on each material resource. Some constraints have to be respected: compatibilities between exams and resources, resources opentime. We propose a mathematical model. It deals with an exams planning taking into account the assignment of material resources in the community over a given horizon planning. The problem is solved in an exact way and with approach methods applying bin packing heuristics and single solution based metaheuristics. Experimentation tackles with randomly generated instances.

References

  1. Aarts, E. and van Laarhoven, P. (1987). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers.
  2. Beigel, R. and Fu, B. (2012). A dense hierarchy of sublinear time approximation schemes for bin packing. In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pages 172-181. Springer.
  3. Coffman Jr, E. G., Garey, M. R., and Johnson, D. S. (1996). Approximation algorithms for bin packing: A survey. In Approximation algorithms for NP-hard problems, pages 46-93. PWS Publishing Co.
  4. Corcoran, A. L. and Wainwright, R. L. (1995). Using libga to develop genetic algorithms for solving combinatorial optimization problems. Practical Handbook of Genetic Algorithms, 1:143-172.
  5. Fleury, G. (1993). Méthodes stochastiques et déterministes pour les problèmes NP-difficiles. Ph.D., Université Blaise Pascal, Clermont-Ferrand II.
  6. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NPcompleteness. WH Freeman and Company, New York.
  7. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21:1087-1092.
Download


Paper Citation


in Harvard Style

Gourgand M., Grangeon N. and Klement N. (2014). Activities Planning and Resource Assignment on Multi-place Hospital System - Exact and Approach Methods Adapted from the Bin Packing Problem . In Proceedings of the International Conference on Health Informatics - Volume 1: HEALTHINF, (BIOSTEC 2014) ISBN 978-989-758-010-9, pages 117-124. DOI: 10.5220/0004803901170124


in Bibtex Style

@conference{healthinf14,
author={Michel Gourgand and Nathalie Grangeon and Nathalie Klement},
title={Activities Planning and Resource Assignment on Multi-place Hospital System - Exact and Approach Methods Adapted from the Bin Packing Problem},
booktitle={Proceedings of the International Conference on Health Informatics - Volume 1: HEALTHINF, (BIOSTEC 2014)},
year={2014},
pages={117-124},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004803901170124},
isbn={978-989-758-010-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Health Informatics - Volume 1: HEALTHINF, (BIOSTEC 2014)
TI - Activities Planning and Resource Assignment on Multi-place Hospital System - Exact and Approach Methods Adapted from the Bin Packing Problem
SN - 978-989-758-010-9
AU - Gourgand M.
AU - Grangeon N.
AU - Klement N.
PY - 2014
SP - 117
EP - 124
DO - 10.5220/0004803901170124