메뉴 건너뛰기




Volumn 1153, Issue , 1996, Pages 146-161

Complete university modular timetabling using constraint logic programming

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; RECONFIGURABLE HARDWARE; SCHEDULING;

EID: 84958750405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61794-9_57     Document Type: Conference Paper
Times cited : (26)

References (22)
  • 2
    • 0025725556 scopus 로고
    • Constructing school timetables using simulated annealing: Sequentim and parallel algorithms
    • Jan
    • D. Abramson. Constructing school timetables using simulated annealing: sequentim and parallel algorithms. Management Science, 37(1):98-113, Jan. 1991.
    • (1991) Management Science , vol.37 , Issue.1 , pp. 98-113
    • Abramson, D.1
  • 3
    • 84958767309 scopus 로고
    • Large Scale Applications
    • Eric Atwell and Gyuri Lajos. Knowledge and Constraint Management, Leeds University Press
    • Eric Atwell and Gyuri Lajos. Knowledge and Constraint Management: Large Scale Applications. In Knowledge at Work in Universities, pages 21-25. Leeds University Pr,ess 1993.
    • (1993) Knowledge at Work in Universities , pp. 21-25
    • Atwell, E.1    Gyuri, L.2
  • 7
    • 84958983442 scopus 로고
    • A university timetabling system based on graph colouring and constraint manipulation
    • E.K. Burke, D.G. Elliman, and R. Weare. A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Comput. ing in Education, 27(1):1-18, 1994.
    • (1994) Journal of Research on Comput. Ing in Education , vol.27 , Issue.1 , pp. 1-18
    • Burke, E.K.1    Elliman, D.G.2    Weare, R.3
  • 8
    • 38249016030 scopus 로고
    • Modelling and solving an acyclic multiperiod timetabling problem
    • March
    • M. Cangalovic and J.A.M. Schreuder. Modelling and solving an acyclic multiperiod timetabling problem. Discrete Applied Mathematics, 35(3):177-95, 6 March 1992.
    • (1992) Discrete Applied Mathematics , vol.35 , Issue.3 , pp. 177-195
    • Cangalovic, M.1    Schreuder, J.2
  • 9
    • 85030631924 scopus 로고
    • Genetic algorithms and highly constrained problems: The time-table case
    • In R. Schwefel, H.-P.; Manner, editor, Dortmund, West Germany, Springer-Verlag
    • A. Colorni, M. Dorigo, and V. Maniezzo. Genetic algorithms and highly constrained problems: the time-table case. In R. Schwefel, H.-P.; Manner, editor, Parallel Problem Solving from Nature. 1st Workshop, pages 55-9, Dortmund, West Germany, 1991. Springer-Verlag.
    • (1991) Parallel Problem Solving from Nature. 1St Workshop , pp. 55-59
    • Colorni, A.1    Dorigo, M.2    Maniezzo, V.3
  • 10
    • 84992927606 scopus 로고
    • Fast Practical Evolutionary Timetabling
    • T. Fogarty, editor, Selected Papers, number 865 in Lecture Notes in Computer Science. Springer Verlag
    • Dave Come, Peter Ross, and Hsiao-Lan Fang. Fast Practical Evolutionary Timetabling. In T. Fogarty, editor, Evolutionary Computing: AISB Workshop 1994, Selected Papers, number 865 in Lecture Notes in Computer Science. Springer Verlag, 1994.
    • (1994) Evolutionary Computing: AISB Workshop 1994
    • Come, D.1    Ross, P.2    Fang, H.-L.3
  • 12
    • 0025507522 scopus 로고
    • A timetabling problem in which clashes are inevitable
    • K.A. Dowsland. A timetabling problem in which clashes are inevitable. Journal of the Operational Research Society, 41(10):907-18, Oct. 1990.
    • (1990) Journal of the Operational Research Society , vol.41 , Issue.10 , pp. 907-918
    • Dowsland, K.A.1
  • 15
    • 0001644021 scopus 로고
    • Finding a feasible course schedule using tabu search
    • March
    • Alain Hertz. Finding a feasible course schedule using tabu search. Discrete Applied Mathematics, 35(3):255-70, 6 March 1992.
    • (1992) Discrete Applied Mathematics , vol.35 , Issue.3 , pp. 255-270
    • Hertz, A.1
  • 17
    • 0026926482 scopus 로고
    • A logic approach to the resolution of constraints in timetabling
    • 25 Sept
    • L. Kang and G.M. White. A logic approach to the resolution of constraints in timetabling. European Journal of Operational Research, 61(3):306-17, 25 Sept. 1992.
    • (1992) European Journal of Operational Research , vol.61 , Issue.3 , pp. 306-317
    • Kang, L.1    White, G.M.2
  • 18
    • 0026765586 scopus 로고
    • Weighted graphs and university course timetabling
    • Jan
    • L. Kiaer and J. Yellen. Weighted graphs and university course timetabling. Computers s Operations Research, 19(1):59-67, Jan. 1992.
    • (1992) Computers S Operations Research , vol.19 , Issue.1 , pp. 59-67
    • Kiaer, L.1    Yellen, J.2
  • 19
    • 0027642016 scopus 로고
    • Timetable construction with markovian neural network
    • Aug
    • M. Kovacic. Timetable construction with markovian neural network. European Journal of Operational Research, 69(3):92-6, 27 Aug. 1993.
    • (1993) European Journal of Operational Research , vol.69 , Issue.3 , pp. 92-96
    • Kovacic, M.1
  • 20
    • 35048866090 scopus 로고
    • Foundations of Constraint Satisfaction
    • Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1994.
    • (1994) Academic Press
    • Tsang, E.1
  • 21
    • 0003683967 scopus 로고
    • Constraint Satisfaction in Logic Programming
    • MIT Press, Cambridge, MA
    • Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA, 1989.
    • (1989) Logic Programming Series
    • Hentenryck, P.V.1
  • 22
    • 84971954260 scopus 로고
    • Constraint logic programming
    • September, (Also available as Brown University Technical Report CS-91-05)
    • Pascal Van Hentenryck. Constraint logic programming. Knowledge Engineering Review, 6(3):151-194, September 1991. (Also available as Brown University Technical Report CS-91-05).
    • (1991) Knowledge Engineering Review , vol.6 , Issue.3 , pp. 151-194
    • Hentenryck, P.V.1


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