Abstract
Creating an employee schedule means taking into account many heavy constraints like employee contracts or minimal staffing levels on the one hand and many global, difficult to formalize constraints like aspects of fairness on the other hand. Optimisation is quite difficult especially when fix rostering schemata cannot be used, e.g. because of frequently varying staffing levels. In this paper we present how real-life employee scheduling problems can be solved by applying a Hybrid Genetic Algorithm that uses problem specific knowledge. First we briefly describe the given problem domain, then the idea and implementation of the Genetic Algorithm is presented. Finally we show some application results and the outlook.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Meisels and N. Lusternik, “Experiments on Networks of Employee Timetabling Problems”, in Proceedings of the Second International Conference on the Practice and Theory of Automated Timetabling, ed.s E. Burke and M. Carter, pp. 215–228, Springer, 1997.
E. Burke and D. Elliman and R. Weare, “Specialised Recombinative Operators for Timetabling Problems”, in Proceedings of the AISB (AI and Simulated Behaviour) Workshop on Evolutionary Computing, pp. 75–85, Heidelberg, Springer, 1995.
D. Corne and P. Ross and H.-L. Fang, “Evolutionary Timetabling: Practice, Prospects and Work in Progress”, in Proceedings of the UK Planning and Scheduling SIG Workshop, ed. P. Prosser, University of Strathclyde, 1994.
C. Fernandes and J.P. Caldeira and F. Melicio and A. Rosa, “High School Weekly Timetabling by Evolutionary Algorithms”, in Proceedings of 14th Annual Acm Symposium On Applied Computing, San Antonio, Texas, 1999.
D. Mattfeld, “Scalable Search Spaces for Scheduling Problems”, in Proceedings of GECCO99, ed.s W. Banzhaf et al, pp. 1616–1621, Morgan Kaufmann, 1999.
R. Weare and E. Burke and D. Elliman, “A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems”, in Proceedings of the Sixth International Conference on Genetic Algorithms, ed. L.J. Eshelman, pp. 605–610, Pittsburg, Morgan Kaufmann, 1995.
M. Gröbner and P. Wilke, “Rostering with a Hybrid Genetic Algorithm”, to be published in Proceedings of Fifth International Conference on Artificial Neural Networks and Genetic Algorithms, Springer, 2001.
D.E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison-Wesley, 1989.
I. Rechenberg, “Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution”, Fromann-Holzboog, 1973.
M. Gröbner, “Optimierung der Einsatzplanung für Personal im Schichtdienst”, Master Thesis, Universität Erlangen-Nürnberg, October 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gröbner, M., Wilke, P. (2001). Optimizing Employee Schedules by a Hybrid Genetic Algorithm. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_48
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive