A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling

Published Online:https://doi.org/10.1287/ijoc.1080.0298

References

  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Aickelin U., Dowsland K. Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. Scheduling (2000) 3(3):139–153CrossrefGoogle Scholar
  • Aickelin U., Dowsland K. An indirect genetic algorithm for a nurse scheduling problem. Comput. Oper. Res. (2003) 31(5):761–778CrossrefGoogle Scholar
  • Aickelin U., Li J. An estimation of distribution algorithm for nurse scheduling. Ann. Oper. Res. (2007) 155(1):289–309CrossrefGoogle Scholar
  • Aickelin U., White P. Building better nurse scheduling algorithms. Ann. Oper. Res. (2004) 128(1–4):159–177CrossrefGoogle Scholar
  • Aickelin U., Burke E. K., Li J. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J. Oper. Res. (2007) 58:1574–1585CrossrefGoogle Scholar
  • Aickelin U., Burke E. K., Li J. An evolutionary squeaky wheel optimization approach to personnel scheduling. IEEE Trans. Evolut. Comput. (2009) 13(2):433–443CrossrefGoogle Scholar
  • Anzai M., Miura Y. Computer program for quick work scheduling of nursing staff. Medical Informatics (1987) 12(1):43–52CrossrefGoogle Scholar
  • Bard J., Purnomo H. W. Preference scheduling for nurses using column generation. Eur. J. Oper. Res. (2006) 164(2):510–534CrossrefGoogle Scholar
  • Bard J., Purnomo H. W. A cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Scheduling (2007) 10:5–23CrossrefGoogle Scholar
  • Beddoe G., Petrovic S. Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. Eur. J. Oper. Res. (2006) 175(2):649–671CrossrefGoogle Scholar
  • Beliën J., Demeulemeester E. L. Building cyclic master surgery schedules with leveled resulting bed occupancy. Eur. J. Oper. Res. (2006) 176(2):1185–1204CrossrefGoogle Scholar
  • Blau R. Multishift personnel scheduling with a microcomputer. Personnel Administrator (1985) 20:43–58Google Scholar
  • Bradley D., Martin J. Continuous personnel scheduling algorithms: A literature review. J. Soc. Health Systems (1990) 2(2):8–23Google Scholar
  • Brusco M. J., Jacobs L. W. Cost analysis of alternative formulations for personnel scheduling in continuously operating organisations. Eur. J. Oper. Res. (1995) 86(2):249–261CrossrefGoogle Scholar
  • Burke E. K., De Causmaecker P., Vanden Berghe G., McKay B., Yao X., Newton C. S., Kim J.-H., Furuhashi T. A hybrid tabu search algorithm for the nurse rostering problem. Simulated Evolution and Learning (1999) 1585(Springer, Berlin) 187–194Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Burke E. K., Kendall G., Soubeiga E. A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics (2003a) 9(6):451–470CrossrefGoogle Scholar
  • Burke E. K., Cowling P., De Causmaecker P., Vanden Berghe G. A memetic approach to the nurse rostering problem. Appl. Intelligence (2001) 15(3):199–214CrossrefGoogle Scholar
  • Burke E. K., De Causmaecker P., Petrovic S., Vanden Berghe G., Resende M. G. C., De Sousa J. P. Variable neighbourhood search for nurse rostering problems. Metaheuristics: Computer Decision-Making (2004a) (Kluwer, Norwell, MA) 153–172Combinatorial Optimization Book SeriesChapter 7Google Scholar
  • Burke E. K., De Causmaecker P., Vanden Berghe G., Van Landeghem H. The state of the art of nurse rostering. J. Scheduling (2004b) 7(6):441–499CrossrefGoogle Scholar
  • Burke E. K., Kendall G., Newall J., Hart E., Ross P., Schulenburg S., Glover F., Kochenberger G. Hyper-heuristics: An emerging direction in modern search technology. Handbook of Metaheuristics. International Series in Operations Research and Management Series (2003b) 57(Kluwer, Norwell, MA) 457–470CrossrefGoogle Scholar
  • Cheang B., Li H., Lim A., Rodrigues B. Nurse rostering problems—A bibliographic survey. Eur. J. Oper. Res. (2003) 151(3):447–460CrossrefGoogle Scholar
  • Chen J. G., Yeung T. Hybrid expert system approach to nurse scheduling. Comput. Nursing (1993) 11(4):183–192Google Scholar
  • Dowsland K. Nurse scheduling with tabu search and strategic oscillation. Eur. J. Oper. Res. (1998) 106(2–3):393–407CrossrefGoogle Scholar
  • Dowsland K., Thompson J. Nurse scheduling with knapsacks, networks and tabu search. J. Oper. Res. Soc. (2000) 51:825–833CrossrefGoogle Scholar
  • Ernst A. T., Jiang H., Krishnamoorthy M., Sier D. Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. (2004a) 153(1):3–27CrossrefGoogle Scholar
  • Ernst A. T., Jiang H., Krishnamoorthy M., Owens B., Sier D. An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. (2004b) 127(1–4):21–144CrossrefGoogle Scholar
  • Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1(3):190–206LinkGoogle Scholar
  • Kawanaka H., Yamamoto K., Yoshikawa T., Shinigi T., Tsuruoka S. Genetic algorithm with the constraints for nurse scheduling problem. Proc. Congress on Evolutionary Comput. (CEC'01) (2001) Seoul, Korea(IEEE, Piscataway, NJ) 1123–1130CrossrefGoogle Scholar
  • Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220(4598):671–680CrossrefGoogle Scholar
  • Li J., Aickelin U., Yao X., Burke E., Lozano J. A., Smith J., Merelo-Guervós J. J., Bullinaria J. A., Rowe J., Tiňo P., Kabán A., Schwefel H.-P. The application of Bayesian optimization and classifier systems in nurse scheduling. Proc. 8th Internat. Conf. Parallel Problem Solving from Nature (PPSN VIII) (2004) 3242(Springer, Berlin) 581–590Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Lourenço H. R., Martin O. C., Stützle T., Glover F., Kochenberger G. Iterated local search. Handbook of Metaheuristics: International Series in Operations Research and Management Science (2003) 57(Kluwer, Norwell, MA) 321–353CrossrefGoogle Scholar
  • Meyer auf'm Hofe H., Burke E. K., Erben W. Solving rostering tasks as constraint optimization. Practice and Theory of Automated Timetabling, 3rd Internat. Conf. (2001) 2079(Springer, Berlin) 191–212Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Miller H. E., Pierskalla W., Rath G. Nurse scheduling using mathematical programming. Oper. Res. (1976) 24(5):857–870LinkGoogle Scholar
  • Mueller C. W., McCloskey J. C. Nurses' job satisfaction: A proposed measure. Nursing Res. (1990) 39(2):113–117CrossrefGoogle Scholar
  • Özcan E. Memetic algorithms for nurse rostering. Proc. 20th Internat. Sympos. Comput. Inform. Sci. (2005) 3733(Springer, Berlin) 482–492Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Ross P., Burke E. K., Kendall G. Hyper-heuristics. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Methodologies (2005) (Springer, New York) 529–556Chapter 16CrossrefGoogle Scholar
  • Schrimpf G., Schneider J., Stamm-Wilbrandt H., Dueck G. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. (2000) 159(2):139–171CrossrefGoogle Scholar
  • Silvestro R., Silvestro C. An evaluation of nurse rostering practices in the National Health Service. J. Adv. Nursing (2000) 32(3):525–535CrossrefGoogle Scholar
  • Sitompul D., Randhawa S. Nurse scheduling models: A state-of-the-art review. J. Soc. Health Systems (1990) 2(1):62–72Google Scholar
  • Tien J. M., Kamiyama A. On manpower scheduling algorithms. Soc. Indust. Appl. Math. (1982) 24(3):275–287CrossrefGoogle Scholar
  • Warner M., Prawda J. A mathematical programming model for scheduling nursing personnel in a hospital. Management Sci. (1972) 19(4, Part 1):411–422LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.