An improved memetic algorithm for break scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6373 LNCS, Issue , 2010, Pages 133-147

  Widl, Magdalena ^a   Musliu, Nysret ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH; MEMETIC; MEMETIC ALGORITHMS; SCHEDULING PROBLEM; SELECTION OPERATORS; STAFFING REQUIREMENTS; STATE OF THE ART; UPPER BOUND; WORKING AREAS;

AIR TRAFFIC CONTROL; EMPLOYMENT; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; PERSONNEL; BENCHMARKING; SCHEDULING; TRAFFIC CONTROL;

SCHEDULING ALGORITHMS;

EID: 78349278043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16054-7_10     Document Type: Conference Paper

References (18)

1. Aykin, T.: A comparative evaluation of modelling approaches to the labour shift scheduling problem. European Journal of Operational Research 125, 381-397 (2000)
2. Bechtold, S., Jacobs, L.: Implicit modelling of flexible break assignments in optimal shift scheduling. Management Science 36(11), 1339-1351 (1990)
3. Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., Slany, W.: Scheduling breaks in shift plans for call centers. In: The 7th International Conference on the Practice and Theory of Automated Timetabling, Montréal, Canada (2008)
4. Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., Slany, W.: An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems 25(2), 60-73 (2010)
5. Brindle, A.: Genetic algorithms for function optimisation. PhD thesis, University of Alberta, Department of Computer Science, Edmonton, Canada (1981)
6. Canon, C.: Personnel scheduling in the call center industry. 4OR: A Quarterly Journal of Operations Research 5(5(1), 89-92 (1989)
7. Côté, M.-C., Gendron, B., Quimper, C.-G., Rousseau, L.-M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints (2009)
8. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61-95 (1991)
9. Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., Slany, W.: A hybrid LS-CP solver for the shifts and breaks design problem. In: The 7th International Workshop on Hybrid Metaheuristics (HM 2010), Vienna, Austria. LNCS. Springer, Heidelberg (2010) (to appear)
10. Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading (1989)
11. Montgomery, D.: Design and Analysis of Experiments, 6th edn. John Wiley & Sons, Chichester (2005)
12. Moscato, P.: On evolution, search, optimization, gas and martial arts: Towards memetic algorithms. Technical Report Caltech Concurrent Comput. Prog. Rep. 826, California Institute of Technology (1989)
13. Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: 8th Metaheuristic International Conference, Hamburg, Germany (2009)
14. Quimper, C.-G., Rousseau, L.-M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics 16(3), 373-391 (2010)
15. Rekik, M., Cordeau, J., Soumis, F.: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. Journal of Scheduling 13, 49-75 (2010)
16. http://www.dbai.tuwien.ac.at/proj/SoftNet/Supervision/Benchmarks/ (2008)
17. Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 293-302. Springer, Heidelberg (2006)
18. Widl, M.: Memetic algorithms for break scheduling. Master's thesis, Vienna University of Technology, Vienna, Austria (2010)