Construction-based metaheuristics for personnel scheduling problems.

0044 English OPEN
Goodman, Melissa Dee;
  • Subject: QA

This thesis investigates the idea of balancing different constraints in order to find optimal solutions to two personnel scheduling problems, within the framework of constructive metaheuristic approaches. The two problems considered are a nurse scheduling problem, for w... View more
  • References (21)
    21 references, page 1 of 3

    Appendix A - Nurse scheduling datasets..............................................314 A. 1 Sample dataset............................................................................................... 327 Appendix B - Calculation of nurse preference costs..........................331 Appendix E - Tabu search..................................................................... 341 Appendix F - Genetic algorithms..........................................................343 Appendix G - Paper accepted for publication.....................................345 Chapter 2 - Introduction to problems Figure 2.1 An example of an nxn Latin square with entries a# = i..................29 Figure 2.2 Latin rectangle setup of the medical student scheduling problem for specialities 2 - 5 ........................................................................ 30 Figure 2.3 Example demonstrating how using a group-rotation approach to guarantee feasibility may result in higher than necessary student pair costs.......................................................................................... 35 Abramson, D. (1991). “Constructing school timetables using simulated annealing: sequential and parallel algorithms”, Man. Sci., 37, 98-113.

    Aickelin, U. and K. A. Dowsland (2000). “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem,” J. Sched., 3, 139-153.

    Aickelin, U. and K. A. Dowsland (2004). “An Indirect Genetic Algorithm for a nursescheduling problem,” Comput. Oper. Res. 31, 761-778.

    Aickelin, U. and J. Li (2007). “An Estimation of Distribution Algorithm for Nurse Scheduling,” to appear in Annals o f Oper. Res.

    Aiex, R.M., S. Binato, and M.G.C. Resende (2003). “Parallel GRASP with pathrelinking for job shop scheduling,” Parallel Computing 29, 393-430.

    Bellanti, F., G. Carello, F. Della Croce, and R. Tadei (2004). “A greedy-based neighbourhood search approach to a nurse rostering problem,” Eur. J. Oper. Res. 153, 28-40.

    Berrada, I., J. A. Ferland, and P. Michelon (1996). “A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints,” Socio-Economic Planning Sciences, 30, 183-193.

    Binato, S., W. J. Hery, D. M. Loewenstem and M. G. C. Resende (2001). “A GRASP for job shop scheduling”, Essays and surveys in metaheuristics, 15, 81-100.

    Brusco, M.J. and L. W. Jacobs (1995). “Cost Analysis of Alternative Formulations for Personnel Scheduling in Continuous Operating Organizations.” Eur. J. Oper. Res 86, 249-261.

    Burke, E., P. Cowling, P. De Causmaecker and G.Vanden Berghe (2001). “A Memetic Approach to the Nurse Rostering Problem ”, Applied Intelligence, 15, No. 3, 199-214.

  • Metrics
Share - Bookmark