The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Bibliography 118<br />
[10] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide<br />
to the <strong>The</strong>ory of NP-Completeness. W. H. Freeman & Co. New York, NY, USA,<br />
1979.<br />
[11] F. Glover. Future paths for integer programming and links to artificial intelligence.<br />
Comput. Oper. Res., (13):533–549, 1986.<br />
[12] Fred Glover and Fred Laguna. Tabu Search. Kluwer Academic Publishers, 1997.<br />
[13] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Au-<br />
tomata <strong>The</strong>ory, Languages, and Computation. Addison-Wesley, 2001.<br />
[14] Rudy Hung. Improving productivity and quality through workforce scheduling.<br />
Industrial Management, 34(6):4–6, 1992.<br />
[15] Richard M. Karp. Complexity of Computer Computations, pages 85–103. R. E.<br />
Miller and J. W. Thatcher (editors). New York: Plenum, 1972. Chapter: Re-<br />
ducibility Among Combinatorial <strong>Problem</strong>s.<br />
[16] Amnon Meisels and Andrea Schaerf. Solving employee timetabling problems by<br />
generalized local search. In Proceedings of the 6th Congress of the Italian Associa-<br />
tion for Artificial Intelligence on Advances in Artificial Intelligence, pages 380–389,<br />
1999.<br />
[17] Henrik Berg Nielsen. Algoritmer til vagtplanlægning for sygeplejersker. Master’s<br />
thesis, Syddansk Universitet Odense, Juni 2006.<br />
[18] Koji Nonobe and Toshihide Ibaraki. An improved tabu search method for the<br />
weighted constraint satisfaction problem. INFOR, 39(1):131–151, 2001.<br />
[19] Mauricio G. C. Resende and Thomas A. Feo. Greedy randomized adaptive search<br />
procedures. Technical report, <strong>The</strong> University of Texas, Austin, TX 78712 USA and<br />
AT&T Bell Laboratories, Murray Hill, NJ 07974 UAS, February 1994.<br />
[20] Mauricio G. C. Resende and Celso C. Ribeiro. Greedy randomized adaptive search<br />
procedures. Technical Report TD-53RSJY, AT&T Labs Research, August 2002.<br />
Version 2. To appear in State of the Art Handbook in Metaheuristics, F. Glover and<br />
G. Kochenberger, eds., Kluwer, 2002.<br />
[21] Robert Sedgewick and Kevin Wayne. Perm.java, 2006–2007. URL http://www.<br />
cs.princeton.edu/introcs/23recursion/Perm.java.html.<br />
[22] Rhian Silvestro and Claudio Silvestro. An evaluation of nurse rostering practices<br />
in the national health service. Journal of Advanced Nursing, 32(3):525–535, 2000.