메뉴 건너뛰기




Volumn 2079 LNCS, Issue , 2001, Pages 28-47

A generic object-oriented constraint-based model for university course timetabling

Author keywords

[No Author keywords available]

Indexed keywords

C++ (PROGRAMMING LANGUAGE); CONSTRAINT THEORY; SCHEDULING; COMPUTER PROGRAMMING;

EID: 84889586448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_3     Document Type: Conference Paper
Times cited : (10)

References (30)
  • 1
    • 0041875658 scopus 로고    scopus 로고
    • A two-stage multiobjective scheduling model for [Faculty-Course-Time] assignments
    • Badri, M.: A Two-Stage Multiobjective Scheduling Model for [Faculty-Course-Time] Assignments. Eur. J. Oper. Res. 94 (1996) 16-28
    • (1996) Eur. J. Oper. Res. , vol.94 , pp. 16-28
    • Badri, M.1
  • 4
    • 0018456690 scopus 로고
    • New methods to color the vertices of a graph
    • Brelaz, D.: New Methods to Color the Vertices of a Graph. JACM 22 (1979) 251-256
    • (1979) JACM , vol.22 , pp. 251-256
    • Brelaz, D.1
  • 5
    • 0031368151 scopus 로고    scopus 로고
    • Automated university timetabling: The state of the art
    • Burke, E., Jackson, K., Kingston, J., Weare, R.: Automated University Timetabling: The State of the Art. Comput. J. 40 (1997) 565-571
    • (1997) Comput. J. , vol.40 , pp. 565-571
    • Burke, E.1    Jackson, K.2    Kingston, J.3    Weare, R.4
  • 6
    • 0024961858 scopus 로고
    • An interactive system for constructing timetables on a PC
    • Chahal, N., de Werra, D.: An Interactive System for Constructing Timetables on a PC. Eur. J. Oper. Res. 40 (1989) 32-37
    • (1989) Eur. J. Oper. Res. , vol.40 , pp. 32-37
    • Chahal, N.1    De Werra, D.2
  • 7
    • 0022014119 scopus 로고
    • An introduction to timetabling
    • de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151-162
    • (1985) Eur. J. Oper. Res. , vol.19 , pp. 151-162
    • De Werra, D.1
  • 8
    • 0031076097 scopus 로고    scopus 로고
    • The combinatorics of timetabling
    • de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96 (1997) 504-513
    • (1997) Eur. J. Oper. Res. , vol.96 , pp. 504-513
    • De Werra, D.1
  • 12
    • 0002434786 scopus 로고
    • Dual viewpoint heuristics for binary constraint satisfaction problems
    • Geelen, P. A.: Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In: Proc. 10th Eur. Conf. on Artificial Intelligence (1992) 31-35
    • (1992) Proc. 10th Eur. Conf. on Artificial Intelligence , pp. 31-35
    • Geelen, P.A.1
  • 15
    • 0010571491 scopus 로고
    • The construction of class-teacher timetables
    • Gotlieb, C.: The Construction of Class-Teacher Timetables. In: Proc. IFIP Congress (1962) 73-77
    • (1962) Proc. IFIP Congress , pp. 73-77
    • Gotlieb, C.1
  • 17
    • 0019067870 scopus 로고
    • Increasing tree search efficiency for constraint satisfaction problems
    • Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artif. Intell. 14 (1980) 263-313
    • (1980) Artif. Intell. , vol.14 , pp. 263-313
    • Haralick, R.M.1    Elliott, G.L.2
  • 22
    • 84958750405 scopus 로고
    • Complete university modular timetabling using constraint logic programming
    • Burke, E., Ross, P. (eds.) . Springer-Verlag, Berlin Heidelberg New York
    • Lajos, G.: Complete University Modular Timetabling Using Constraint Logic Programming. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 146-161
    • (1995) Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science , vol.1153 , pp. 146-161
    • Lajos, G.1
  • 23
    • 0002510098 scopus 로고
    • The application of a graph coloring method to an examination scheduling problem
    • Mehta, N.: The Application of a Graph Coloring Method to an Examination Scheduling Problem. Interfaces 11 (1981) 57-64
    • (1981) Interfaces , vol.11 , pp. 57-64
    • Mehta, N.1
  • 26
    • 0012850410 scopus 로고    scopus 로고
    • Nearly optimum timetable construction through CLP and intelligent search
    • Stamatopoulos, P., Viglas, E., Karaboyas, S.: Nearly Optimum Timetable Construction Through CLP and Intelligent Search. Int. J. Artif. Intell. Tools 7 (1998) 415-442
    • (1998) Int. J. Artif. Intell. Tools , vol.7 , pp. 415-442
    • Stamatopoulos, P.1    Viglas, E.2    Karaboyas, S.3
  • 28
    • 0026941401 scopus 로고
    • A generic arc-consistency algorithm and its specializations
    • van Hentenryck, P., Deville, Y., Teng, C.M.: A Generic Arc-Consistency Algorithm and its Specializations. Artif. Intell. 57 (1992) 291-321
    • (1992) Artif. Intell. , vol.57 , pp. 291-321
    • Van Hentenryck, P.1    Deville, Y.2    Teng, C.M.3
  • 30
    • 84956983972 scopus 로고    scopus 로고
    • Generating complete university timetables by combining Tabu search with constraint logic
    • Burke, E., Ross, P. (eds.) . Springer-Verlag, Berlin Heidelberg New York
    • White, G., Zhang, J.: Generating Complete University Timetables by Combining Tabu Search with Constraint Logic. In: Burke, E., Ross, P. (eds.): Proc. 2nd Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1997) 187-198
    • (1997) Proc. 2nd Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science , vol.1408 , pp. 187-198
    • White, G.1    Zhang, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.