Using simulated annealing and genetic algorithms to solve staff scheduling problems

Asia-Pacific Journal of Operational Research

Volumn 14, Issue 2, 1997, Pages 27-43

  Bailey, R N ^a,b   Garner, K M ^a   Hobbs, M F ^a  

^a Applied Mathematics   (New Zealand)

^b New Zealand Inst Indust R and D   (New Zealand)

Author keywords

Genetic algorithms; Optimisation; Productivity; Simulated annealing; Staff scheduling

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PERSONNEL; PRODUCTIVITY; SIMULATED ANNEALING;

OPTIMA; STAFF SCHEDULING PROBLEM;

SCHEDULING;

EID: 0031270809     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. Abramson, D. (1991), Constructing school timetables using simulated annealing: Sequential and parallel algorithms, Management Science 37 (1), 98-113.
2. Balakrishnan, H. and R. T. Wong (1990), A network model for the rotating workforce scheduling problem, Networks 20, 25-42.
3. Davis, L., ed. (1991), Handbook of Genetic Algorithms, Van Nostrand Reinhold.
4. Day, P. (1992), Domestic cabin crew rostering for Air New Zealand, in Proceedings of the 28th Annual Conference, Operational Research Society of New Zealand, 39-46.
5. Dowsland, K. A. (1990), A timetabling problem in which clashes are inevitable, Journal of the Operational Research Society 41 (10), 907-918.
6. Eglese, R. W. (1990), Simulated annealing : A tool for operational research, European Journal of Operational Research 46 (3), 217-281.
7. Eglese, R. W. and G. K. Rand (1987), Conference seminar timetabling, Journal of the Operational Research Society 38 (7), 591-598.
8. Falkner, J. C. and D. M. Ryan (1987), A bus crew scheduling system using a set partitioning model, Asia Pacific Journal of Operational Research 4 (1), 39-56.
9. Gass, S. I. (1991), Military manpower planning models, Computers and Operations Research 18 (1), 65-73.
10. Glover, F. and H. J. Greenberg (1989), New approaches for heuristic search : A bilateral linkage with artificial intelligence, European Journal of Operational Research 39 (2), 119-130.
11. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley.
12. Golden, B. L. and C. G. Skiscim (1986), Using simulated annealing to solve routing and location problems, Naval Research Logistics Quarterly 33 (2), 261-279.
13. Helming, R. and K. Jornsten (1991), A simulated annealing algorithm for general zero-one programming problems, Journal of Information Optimization Sciences 12 (2), 295-306.
14. Holland, J., ed. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press.
15. Johnson, M. E., ed. (1988), Simulated annealing (SA) and Optimization : Modern Algorithms with VLSI, Optimal Design, and Missile Defense Applications Vol 8 of American Journal of Mathematical and Management Sciences, American Sciences Press, Inc.
16. Kirkpatrick, S., C. D. Gelatt, Jr and M. P. Vecchi (1983), Optimization by simulated annealing, Science 220 (4598), 671-680.
17. Kostreva, M. M. and K. S. B. Jennings (1991), Nurse scheduling on a microcomputer, Computers and Operations Research 18 (8), 731-739.
18. Love, Jr., R. R. and J. M. Hoey (1990), Management science improves fastfood scheduling, Interfaces 20 (2), 21-29.
19. Lutton, J. L. and E. Bonomi (1986), Simulated annealing algorithm for the minimum weighted perfect Euclidean matching problem, Revue d'Automatique d'Informatique et de Recherche Operationnelle - Operations Research 20 (3), 177-197.
20. Marsten, R. E. and F. Shepardson (1981), Exact solution of crew scheduling problems using the set partitioning model : Recent successful applications, Networks 11, 165-177.
21. Michalewicz, Z. (1994), Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, second, extended edn.
22. Michalewicz, Z., G. A. Vignaux and M. Hobbs (1991), A non-standard genetic algorithm for the nonlinear transportation problem, ORSA Journal on Computing 3 (3).
23. Mills, R. G. J. and D. M. Panton (1992), Scheduling of casino security officers, OMEGA International Journal of Management Science 20(2), 183-191.
24. Paixao, J. (1991), Transit crew scheduling on a personal workstation (MS/DOS), in H. E. Bradley, ed., Operational Research'90, 421-432, Pergamon Press.
25. Ryan, D. M. and J. A. Meyer (1992), Aspects of crew rostering systems for Air New Zealand international air-crews, in Proceedings of the 28th Annual Conference, 169-174, Operational Research Society of New Zealand.
26. Siferd, S. P. and W. C. Benton (1992), Workforce staffing and scheduling Hospital nursing specific models, European Journal of Operational Research 60, 233-246.
27. Smith, B. M. (1988), IMPACS - a bus crew scheduling system using integer programming, Mathematical Programming 42, 181-187.
28. van Laarhoven, P. J. M. and E. H. L. Aarts (1987), Simulated Annealing : Theory and Applications, D. Reidel Publishing Company, Kluwer Academic Publishers Group.
29. Weber, M. and T. M. Liebling (1986), Euclidean matching problems and metropolis algorithm, Zietschrift fur Operations Research 30(3), 85-110.
30. Wilhelm, M. R. and T. L. Ward (1987), Solving quadratic assignment problems by 'simulated annealing', IIE Transactions, 107-119.