메뉴 건너뛰기




Volumn , Issue , 2009, Pages

The application of a parallel genetic algorithm to timetabling of elementary school classes: A coarse grained approach

Author keywords

Beowulf cluster, MPI; Parallel genetic algorithm; Timetable construction problem

Indexed keywords

BEOWULF CLUSTER; COARSE-GRAINED; CONSTRAINED PROBLEM; ELEMENTARY SCHOOLS; FITNESS EVALUATIONS; MUTATION OPERATORS; NP COMPLETE; PARALLEL EXECUTIONS; PARALLEL GENETIC ALGORITHMS; TIMETABLE CONSTRUCTION; TIMETABLING;

EID: 74549180648     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAT.2009.5348396     Document Type: Conference Paper
Times cited : (8)

References (9)
  • 2
    • 35248822355 scopus 로고    scopus 로고
    • Enhancing Timetable Solutions with Local Search Methods
    • Burke E.K. and De Causmaecker P, eds, Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling
    • Burke E.K. and Newall J. "Enhancing Timetable Solutions with Local Search Methods". In: Burke E.K. and De Causmaecker P. (eds.) Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 2740. pp. 195-206. 2002.
    • (2002) Lecture Notes in Computer Science , vol.2740 , pp. 195-206
    • Burke, E.K.1    Newall, J.2
  • 4
    • 0142190813 scopus 로고
    • Genetic Algorithms and Highly Constrained Problems: The Time-Table Case
    • Goos And Hartmanis eds, Springer-Verlag
    • Colorni, A., Dorigo, M., Maniezzo, V.: "Genetic Algorithms and Highly Constrained Problems: The Time-Table Case". Parallel Problem Solving from Nature I, Goos And Hartmanis (eds.) Springer-Verlag, 1990, pages 55-59
    • (1990) Parallel Problem Solving from Nature I , pp. 55-59
    • Colorni, A.1    Dorigo, M.2    Maniezzo, V.3
  • 6
    • 84958771495 scopus 로고
    • The complexity of timetable construction problems
    • Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling PATAT, Springer Verlag
    • T. B. Cooper and J. H. Kingston. "The complexity of timetable construction problems". In Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling (PATAT 1995), LNCS 1153, pages 283-295. Springer Verlag, 1996
    • (1995) LNCS , vol.1153 , pp. 283-295
    • Cooper, T.B.1    Kingston, J.H.2
  • 7
    • 84878586194 scopus 로고    scopus 로고
    • Timetabling the Classes of an Entire University with an Evolutionary Algorithm
    • TC Fogarty, Springer
    • B Paechter, RC Rankin, A Cumming, "Timetabling the Classes of an Entire University with an Evolutionary Algorithm", TC Fogarty - Lecture notes in computer science, 1998 - Springer
    • (1998) Lecture notes in computer science
    • Paechter, B.1    Rankin, R.C.2    Cumming, A.3
  • 9
    • 74549175107 scopus 로고    scopus 로고
    • http://svn2.assembla.com/svn/memleak/trunk/gatable-parallel-branch1/


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