BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR97-316
ENTRY:: May 30, 1997
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: The Complexity Of Clerkship Scheduling
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Feldman, Jon
DATE:: May 1997
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR97-316.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR97-316.pdf
ABSTRACT:: 
Medical students must complete a clerkship program in their fourth
year.  Individual students have preferences for the clerkships to
which they are assigned. However, individual hospitals also have
capacities on how many students may be assigned to each clerkship.
The problem of scheduling medical students to clerkships is
formalized.  The problem is then placed in a theoretical framework,
and the most general case of Clerkship Scheduling is proven NP-hard. A
detailed approximation algorithm is given, and an implementation of
this algorithm is discussed and tested.
NOTE:: 
Senior Honors Thesis.  Advisor: Cliff Stein.
END:: ncstrl.dartmouthcs//TR97-316