The course scheduling problem as a source of student projects
暂无分享,去创建一个
The course scheduling problem is simple to understand, yet complex enough to admit a wide range of solutions at varying levels of difficulty in implementation. In this work, we outline four types of student projects based on this problem, discuss how these projects can be approached and how they might integrate into a computer science curriculum, and describe two example projects that we have used.
[1] Peter J. Stuckey,et al. Programming with Constraints: An Introduction , 1998 .
[2] Jeffrey H. Kingston,et al. The Complexity of Timetable Construction Problems , 1995, PATAT.
[3] Slim Abdennadher,et al. JACK: A Java Constraint Kit , 1999, Electron. Notes Theor. Comput. Sci..