ALLOCATION OF HUMAN RESOURCES IN MEDICAL COOPERATIVES USING A CONSTRAINT SATISFACTION PROBLEM APPROACH

Cicero F. F. Costa Filho, Marly G. F. Costa, Dayse R. Rocha

References

  1. [1] C. Valouxis and E. Housos, Hybrid optimizationtechniques for the workshift and rest assignment ofnursing personnel, Artificial Intelligence in Medicine,2003, 20, 155-175.
  2. [2] G. Weil, K. Heus, P. François and M. Poujane,Constraint Programming for Nurse Scheduling, IEEEEngineering in Medicine and Biology, 1995, 417–422.
  3. [3] A. Oughalime, W. Ismail, L. Yeun, A tabu searchapproach to the nurse scheduling problem, InternationalSymposium on Information Technology, 2008, 1, 1-7.
  4. [4] C. C. Tsai and S. Li, A two-stage modeling withgenetic algorithms for the nurse scheduling problem,Expert Systems with Applications, 2009, 9506-9512.
  5. [5] K. Dowsland, Nurse scheduling with tabu search andstrategic oscillation, European Journal of OperationalResearch, 1998, 106, 393-407.
  6. [6] C. F. F. Costa Filho, D. R. Rocha, M. G. F. Costa andW. C de A. Pereira, Using Constraint SatisfactionProblem approach to solve human resource allocationproblems in cooperative health services. Expert Systemswith Applications , 2011, doi:10.1016/j.eswa.2011.07.027.
  7. [7] S. Russel and P. Norvig, Artificial Intelligence,Pearson Education, 2003.
  8. [8] V. Kumar, Algorithms for Constraint – SatisfactionProblems: A Survey. AI Magazine, 1992, 13, 32-44.
  9. [9] P. Baptiste, Constraint-based Scheduling: ApplyingConstraint Programming to Scheduling Problems.Compiègne: Kluwer Academic Publishers, 2001.
  10. [10] E. Tsang, Foundations of Constraint Satisfaction.London: Academic Press, 1996.

Important Links:

Go Back