APPLYING COMPUTATIONAL INTELLIGENCE APPROACHES TO THE STAFF SCHEDULING PROBLEM

Vasileios Perlis, Charilaos Akasiadis, Konstantinos Theofilatos, Grigorios N. Beligiannis, Spyridon D. Lykothanasis

Abstract

Staff scheduling for public organizations and institutions is an NP-hard problem and many heuristic optimization approaches have already been developed to solve it. In the present paper, we present two meta-heuristic computational intelligence approaches (Genetic Algorithms and Particle Swarm Optimization) for solving the Staff scheduling problem. A general model for the problem is introduced and it can be used to express most of real-life preferences and employee requirements or work regulations and cases that do not include overlapping shifts. The Genetic Algorithm (GA) is parameterized, giving the user the opportunity to apply many different kinds of genetic operators and adjust their probabilities. Classical Particle Swarm Optimization (PSO) is modified in order to be applicable in such problems, a mutation operator has been added and the produced PSO variation is named dPSOmo (discrete Particle Swarm Optimization with mutation operator). Both methods are tested in three different cases, giving acceptable results, with the dPSOmo outperforming significantly the GA approach. The PSO variation results are very promising, encouraging further research efforts.

References

  1. Baker, A., Roach, G., Ferguson, S., and Dawson, D. (2003). The impact of different rosters on employee work and non-work time preferences. Time Society, 12:315- 332.
  2. Bartholdi, J. J., Orlin, J. B., and Ratliff, H. D. (1980). Cyclic scheduling via integer programs with circular ones. Operations Research, 28:1074-1085.
  3. Brusco, M. (1995). Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations. European Journal of Operational Research, 86:249-261.
  4. Burke, E. K., Causmaecker, P. D., and Landeghem, H. V. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7:441-499.
  5. Burke, E. K., Curtois, T., Post, G. F., Qu, R., and Veltman, B. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188:330- 341.
  6. Cheang, B., Li, H., Lim, A., and Rodrigues, B. (2003). Nurse rostering problems - a bibliographic survey. European Journal of Operational Research, 151:447- 460.
  7. Chen, J. and Yeung, T. (1992). Development of a hybrid expert system for nurse shift scheduling. International Journal of Industrial Ergonomics, 9:315-327.
  8. Dowsland, K. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106:393-407.
  9. Easton, F. F. and Mansour, N. (1993). A distributed genetic algorithm for employee staffing and scheduling problems. In International Conference on Genetic Algorithms, pages 360-367.
  10. Günther, M. and Nissen, V. (2009). A comparison of neighbourhood topologies for staff scheduling with particle swarm optimisation. In German Conference on Artificial Intelligence, pages 185-192.
  11. Heppner, F. and Grenander, U. (1990). A stochastic nonlinear model for coordinated bird flocks.
  12. Jaumard, B., Semet, F., and Vovor, T. (1998). A generalized linear programming model for nurse scheduling. European Journal of Operational Research, 107:1-18.
  13. Kennedy, J. and R.Eberhart (1995). Particle Swarm Optimization, volume IV, pages 1942-1948.
  14. Millar, H. and Kiragu, M. (1998). Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. European Journal of Operational Research, 104:582-592.
  15. Nissen, V. and Günther, M. (2009). Staff scheduling with particle swarm optimisation and evolution strategies. In EvoWorkshops, pages 228-239.
  16. Ozcan, E. (2005). Memetic algorithms for nurse rostering. In International Symposium on Computer and Information Sciences, pages 482-492.
  17. Ozkarahan, I. and Bailey, J. E. (1988). Goal programming model subsystem of a flexible nurse scheduling support system. Iie Transactions, 20:306-316.
  18. Reeves, C. and Rowe, J. (2003). Genetic algorithms: Principles and perspectives: A guide to ga theory.
  19. Reeves, W. (1993). Particle systems-a technique for modelling a class of fuzzy objects. Computers & Graphics.
  20. Weil, G., Heus, K., Francois, P., and Poujade, M. (1995). Constraint programming for nurse scheduling.
Download


Paper Citation


in Harvard Style

Perlis V., Akasiadis C., Theofilatos K., N. Beligiannis G. and D. Lykothanasis S. (2011). APPLYING COMPUTATIONAL INTELLIGENCE APPROACHES TO THE STAFF SCHEDULING PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 168-173. DOI: 10.5220/0003669701680173


in Bibtex Style

@conference{ecta11,
author={Vasileios Perlis and Charilaos Akasiadis and Konstantinos Theofilatos and Grigorios N. Beligiannis and Spyridon D. Lykothanasis},
title={APPLYING COMPUTATIONAL INTELLIGENCE APPROACHES TO THE STAFF SCHEDULING PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={168-173},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003669701680173},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - APPLYING COMPUTATIONAL INTELLIGENCE APPROACHES TO THE STAFF SCHEDULING PROBLEM
SN - 978-989-8425-83-6
AU - Perlis V.
AU - Akasiadis C.
AU - Theofilatos K.
AU - N. Beligiannis G.
AU - D. Lykothanasis S.
PY - 2011
SP - 168
EP - 173
DO - 10.5220/0003669701680173