메뉴 건너뛰기




Volumn 2079 LNCS, Issue , 2001, Pages 322-341

A language for specifying complete timetabling problems

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; STUDENTS; COMPUTATIONAL LINGUISTICS; EDUCATION; TEACHING;

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

References (44)
  • 1
    • 0000915775 scopus 로고
    • School timetables: A case study using simulated annealing applied SA
    • Springer-Verlag, Berlin Heidelberg New York
    • Abramson, D., Dang, H.: School Timetables: A Case Study Using Simulated Annealing, Applied SA. Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin Heidelberg New York (1993) 104-124
    • (1993) Lecture Notes in Economics and Mathematical Systems , pp. 104-124
    • Abramson, D.1    Dang, H.2
  • 2
    • 24744442938 scopus 로고
    • Techniques for producing school timetables on a computer and their application to other scheduling problems
    • Appleby J., Blake D., Newman E.: Techniques for Producing School Timetables on a Computer and Their Application to other Scheduling Problems. Comput. J. 3 (1960) 237-245
    • (1960) Comput. J. , vol.3 , pp. 237-245
    • Appleby, J.1    Blake, D.2    Newman, E.3
  • 3
    • 0142062242 scopus 로고
    • Computer-aided lessons timetables construction, a survey
    • Bardadym, V. Computer-Aided Lessons Timetables Construction, A Survey. USIM - Management Systems and Computers, Vol. 8. (1991) 119-126
    • (1991) USIM - Management Systems and Computers , vol.8 , pp. 119-126
    • Bardadym, V.1
  • 4
    • 84959038415 scopus 로고
    • A simple heuristic to facilitate course timetabling
    • Barham, A., Westwood, J.: A Simple Heuristic to Facilitate Course Timetabling. J. Oper. Res. Soc. 29 (1978) 1055-1060
    • (1978) J. Oper. Res. Soc. , vol.29 , pp. 1055-1060
    • Barham, A.1    Westwood, J.2
  • 11
    • 84957033677 scopus 로고    scopus 로고
    • Recent developments in practical examination timetabling
    • Burke, E., Carter M. (eds.), Springer-Verlag, Berlin Heidelberg New York
    • Carter, M., Laporte, G.: Recent Developments in Practical Examination Timetabling. In: Burke, E., Carter M. (eds.): Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 3-21
    • (1998) Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science , vol.1408 , pp. 3-21
    • Carter, M.1    Laporte, G.2
  • 12
    • 0022679486 scopus 로고
    • A survey of practical applications of examination timetabling algorithms
    • Carter, M.: A Survey of Practical Applications of Examination Timetabling Algorithms. Oper. Res. 34 (1986) 193-202
    • (1986) Oper. Res. , vol.34 , pp. 193-202
    • Carter, M.1
  • 15
    • 84958771495 scopus 로고    scopus 로고
    • The complexity of timetable construction problems
    • Napier University, Edinburgh). Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg New York
    • Cooper, T., Kingston, J.: The Complexity of Timetable Construction Problems. In: PATAT'95: Proc. 1st Int. Conf. on the Practice and Theory of Automated Timttabling (Napier University, Edinburgh). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996)
    • (1996) PATAT'95: Proc. 1st Int. Conf. on the Practice and Theory of Automated Timttabling , vol.1153
    • Cooper, T.1    Kingston, J.2
  • 16
    • 0027851616 scopus 로고
    • The solution of real instances of the timetabling problems
    • Cooper,T., Kingston, J.: The Solution of Real Instances of the Timetabling Problems. Comput. J. 36 (1993) 645-653
    • (1993) Comput. J. , vol.36 , pp. 645-653
    • Cooper, T.1    Kingston, J.2
  • 19
    • 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
  • 21
    • 84889600543 scopus 로고    scopus 로고
    • Eclipse user manual, ECRC GmbH (1992)
    • Aggoun et al.: Eclipse User Manual, ECRC GmbH (1992). Int. Computers Ltd and ICParc (1998)
    • (1998) Int. Computers Ltd and ICParc
    • Aggoun1
  • 22
    • 38249015098 scopus 로고
    • Construction of university faculty timetables using logic programming techniques
    • Fahrion, R., Dollanski G.: Construction of University Faculty Timetables Using Logic Programming Techniques. Discrete Appl. Math. 35 (1992) 221-236
    • (1992) Discrete Appl. Math. , vol.35 , pp. 221-236
    • Fahrion, R.1    Dollanski, G.2
  • 23
    • 0012275569 scopus 로고    scopus 로고
    • Interval propagation to reason about sets: Definition and implementation of a practical language
    • Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints 1 (1997) 191-246
    • (1997) Constraints , vol.1 , pp. 191-246
    • Gervet, C.1
  • 24
    • 0010571491 scopus 로고
    • The construction of class-teacher time-tables
    • Munich
    • Gotlieb, C.: The Construction of Class-Teacher Time-Tables. Proc. IFIP Congress (Munich, 1963) 73-77
    • (1963) Proc. IFIP Congress , pp. 73-77
    • Gotlieb, C.1
  • 28
    • 0001644021 scopus 로고
    • Finding a feasible course schedule using tabu search
    • Hertz, A.: Finding a Feasible Course Schedule using Tabu Search. Discrete Appl. Math. 35 (1992) 225-270
    • (1992) Discrete Appl. Math. , vol.35 , pp. 225-270
    • Hertz, A.1
  • 29
    • 0002962531 scopus 로고
    • Timetabling in germany - A survey
    • Junginger, W.: Timetabling in Germany - a Survey. Interfaces 16 (1986) 66-74
    • (1986) Interfaces , vol.16 , pp. 66-74
    • Junginger, W.1
  • 30
    • 0026926482 scopus 로고
    • A logic approach to the resolution of constraints in timetabling
    • Kang, L., White, G.: A Logic Approach to the Resolution of Constraints in Timetabling. Eur. J. Oper. Res. 61 (1992) 306-317
    • (1992) Eur. J. Oper. Res. , vol.61 , pp. 306-317
    • Kang, L.1    White, G.2
  • 32
    • 0027642016 scopus 로고
    • Timetable construction with a markovian neural network
    • Kovacic, M.: Timetable Construction with a Markovian Neural Network. Eur. J. Oper. Res. 69 (1993)
    • (1993) Eur. J. Oper. Res. , vol.69
    • Kovacic, M.1
  • 33
    • 0010603512 scopus 로고
    • An integer programming model of a school timetabling problem
    • Lawrie, N.: An Integer Programming Model of a School Timetabling Problem. Comput. J. 12 (1969) 307-316
    • (1969) Comput. J. , vol.12 , pp. 307-316
    • Lawrie, N.1
  • 36
    • 84889566953 scopus 로고    scopus 로고
    • Constraint logic programming using set variables for solving timetabling problems
    • Tokyo, Japan, September
    • Reis, L.P., Oliveira, E.: Constraint Logic Programming using Set Variables for Solving Timetabling Problems, INAP'99, 12th Int. Conf. on the Applications of Prolog (Tokyo, Japan, September 1999)
    • (1999) INAP'99, 12th Int. Conf. on the Applications of Prolog
    • Reis, L.P.1    Oliveira, E.2
  • 39
    • 0019081165 scopus 로고
    • Timetable construction - An annotated bibliography
    • Schmidt, G., Strohlein, T.: Timetable Construction - An Annotated Bibliography. Comput. J. 23 (1979) 307-316
    • (1979) Comput. J. , vol.23 , pp. 307-316
    • Schmidt, G.1    Strohlein, T.2
  • 40
    • 0012850410 scopus 로고    scopus 로고
    • Nearly optimum timetable construction through CLP and intelligent search
    • Stamatopoulos, P. et al.: 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
  • 42
    • 0025673475 scopus 로고
    • A decision support system for timetable construction
    • Brighton, UK
    • Verbraeck, A.: A Decision Support System for Timetable Construction. Int. Conf. on Expert Planning Systems (Brighton, UK, 1990) 207-211
    • (1990) Int. Conf. on Expert Planning Systems , pp. 207-211
    • Verbraeck, A.1
  • 43
    • 0002076006 scopus 로고    scopus 로고
    • An upper bound for the chromatic number of a graph and its applications to timetabling problems
    • Welsh, D., Powell M.: An Upper Bound for the Chromatic Number of a Graph and its Applications to Timetabling Problems. Comput. J. 10 (1996) 85-86
    • (1996) Comput. J. , vol.10 , pp. 85-86
    • Welsh, D.1    Powell, M.2
  • 44
    • 84958744274 scopus 로고    scopus 로고
    • Scheduling, timetabling and rostering - A special relationship
    • Burke, E.K., Ross P. (eds.): Springer-Verlag, Berlin Heidelberg New York
    • Wren, A.: Scheduling, Timetabling and Rostering - A Special Relationship. In Burke, E.K., Ross P. (eds.): The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 46-76
    • (1996) The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science , vol.1153 , pp. 46-76
    • Wren, A.1


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