On the Constraint Satisfaction Method for University Personal Course Scheduling

  • Yukio Hori
  • Takashi Nakayama
  • Yoshiro Imai
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 156)


University Students have to decide their own course schedule by themselves. In order to make a course schedule, it is necessary to satisfy the student’s interest and to meet course credit restrictions. On the other hands, the university’s curriculum changes dynamically to catch up with social needs, advanced science and technology. In the many university, there are on-line course support system that allows students view all subjects information is available[4]. However, it is not easy for students to generate manually a course schedule from a large number of combination of classes, due to various constraints and/or criteria, especially for the freshman in the university.


Schedule Problem Constraint Satisfaction Integral Calculus Information Processing Society Plan Support System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hori, Y., Takimoto, M., Imai, Y.: A support system for course schedule design based on syllabus description. In: 8th International Conference on Information Technology Based Higher Education and Training (ITHET), pp. 58–62 (2007)Google Scholar
  2. 2.
    Nozawa, T., Ida, M., et al.: Construction of Curriculum Analyzing System Based on Document Clustering of Syllabus Data(Education). Transactions of Information Processing Society of Japan 46(1), 289–300 (2005)Google Scholar
  3. 3.
    Miyazaki, K., Ida, M., Yoshikane, F., Nozawa, T., Kita, H.: Development of a Course Classification Support System for the Awarding of Degrees using Syllabus Data. IPSJ Journal 46(3), 782–791 (2005)Google Scholar
  4. 4.
    Yamada, S., Matsunaga, Y., Itoh, E., Hirokawa, S.: A Study of Design for Intellingent Web Syllabus Crawling Agent, The transactions of the Institute of Electronics. Information and Communication Engineers, D-I J86-D-I(8), 566–574 (2003)Google Scholar
  5. 5.
    Chubachi, Y., Ishii, Y., Ohiwa, H.: enTrance System Fundamental Concept and Value for a University Environment. In: Software Engineers Association. Software Symposium, pp. 181–184 (2001)Google Scholar
  6. 6.
    Ohiwa, H., Takeda, N., Kawai, K., Shimomi, A.: KJ editor: a card-handling tool for creative work support. Knowledge-Based Systems 10, 43–50 (1997)CrossRefGoogle Scholar
  7. 7.
    Ohmi, Y., Kawai, K., Takeda, N., Ohiwa, H.: Pointing Operations in Cooperative Works using Card-handling Tool ”KJ-Editor”. Transactions of Information Processing Society of Japan 36(11), 2720–2727 (1995)Google Scholar
  8. 8.
    Ikegami, A., Niwa, A., Ookura, M.: Nurse Scheduling Problem in Japan. Operations Research as a Management Science Research 41(8), 436–442 (1996)Google Scholar
  9. 9.
    Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse-scheduling problem. Comput. Oper. Res. 31(5), 761–778 (2004)zbMATHCrossRefGoogle Scholar
  10. 10.
    Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47, 730–743 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Easton, K., Nemhauser, G., and Trick, M.: The traveling tournament problem description and benchmarks. In: Proceedings of Seventh International Conference on Principles and Practice of Constraint Prodram- ming (CP 1999), pp. 580–584 (1999)Google Scholar
  12. 12.
    Horio, M., Suzuki, A.: Development of a General-purpose Scheduling Solver under the Framework of RCPSP/.TAU. with Time Constraints. Journal of Japan Industrial Management Association 54(3), 203–213 (2003)Google Scholar
  13. 13.
    Anderson, J.R.: A spreading activation theory of memory. Journal of Verbal Learning and Verbal Behavior 22, 261–295 (1983)CrossRefGoogle Scholar
  14. 14.
    Collins, A.M., Loftus, E.F.: A Spreading Activation Theory of Semantic Processing. Psychological Review 82, 407–428 (1975)CrossRefGoogle Scholar
  15. 15.
    Lorch, R.F.: Priming and Searching Processes in Semantic Memory: A test of three models of spreading activation. Journal of Verbal Learning and Verbal Behavior 21, 468–492 (1982)CrossRefGoogle Scholar
  16. 16.
    Waltz, D.L., Pollack, J.B.: Massively parallel parsing, A Strongly Interactive Model of Natural Language Interpretation. Cognitive Science 9, 51–74 (1985)CrossRefGoogle Scholar
  17. 17.
    Kozima, H., Ito, A.: Context-sensitive word distance by adaptive scaling of a semantic space. In: Mitkov, R., Nicolov, N. (eds.) Recent Advances in Natural Language Processing, Contemporary Issues in Linguistic Theory, vol. 136, pp. 111–124. John Benjamins, Amsterdam (1997)Google Scholar
  18. 18.
    Huberman, B.A., Hogg, T.: Phase Transition in Artificial Intelligence Systems. Artificial Intelligence 33, 155–171 (1987)CrossRefGoogle Scholar
  19. 19.
    Perkowitz, M., Etzioni, O.: Towards adaptive Web site: Conceptual framework and case study. Artificial Intelligence 118, 245–275 (2000)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Infomation Technology CenterKagawa UniversityTakamatsuJapan
  2. 2.Faculty of ScienceKanagawa UniversityHiratsukaJapan

Personalised recommendations