메뉴 건너뛰기




Volumn 35, Issue 7, 2008, Pages 2209-2233

New integer linear programming approaches for course timetabling

Author keywords

Academic timetabling; Blocking; Integer linear programming

Indexed keywords

COMPUTATION THEORY; DATA REDUCTION; DECISION MAKING; POPULATION DYNAMICS; PROBLEM SOLVING; STUDENTS;

EID: 36349020211     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.10.016     Document Type: Article
Times cited : (42)

References (21)
  • 6
    • 21344481328 scopus 로고
    • SAPHIR: a decision support system for course scheduling
    • Ferland J.A., and Fleurent C. SAPHIR: a decision support system for course scheduling. Interfaces 24 2 (1994) 105-115
    • (1994) Interfaces , vol.24 , Issue.2 , pp. 105-115
    • Ferland, J.A.1    Fleurent, C.2
  • 7
    • 0026417190 scopus 로고
    • Tabu search for large scale timetabling problems
    • Hertz A. Tabu search for large scale timetabling problems. European Journal of Operational Research 54 (1991) 39-47
    • (1991) European Journal of Operational Research , vol.54 , pp. 39-47
    • Hertz, A.1
  • 8
    • 0032142707 scopus 로고    scopus 로고
    • Constructing a course schedule by solving a series of assignment type problems
    • Hertz A., and Robert V. Constructing a course schedule by solving a series of assignment type problems. European Journal of Operational Research 108 (1998) 585-603
    • (1998) European Journal of Operational Research , vol.108 , pp. 585-603
    • Hertz, A.1    Robert, V.2
  • 9
    • 77956263839 scopus 로고    scopus 로고
    • Robert V, Hertz A. How to decompose constrained course scheduling problems into easier assignment type subproblems. In: Burke E, Ross P. editors. Practice and theory of automated timetabling, First international conference, Edinburgh, UK, August/September 1995. Selected papers. Lecture notes in computer science, vol. 1153, Berlin, Heidelberg, New York: Springer; 1996. p. 364-73.
  • 10
    • 36348968219 scopus 로고    scopus 로고
    • Lewandowski G. Practical implementations and applications of graph coloring. PhD thesis, University of Wisconsin-Madison, USA, 1994.
  • 11
    • 36348984917 scopus 로고    scopus 로고
    • Rudova H, Matyska L. Constraint-based timetabling with student schedules. In: Burke E, Erben W, editors. Proceedings of practice and theory of automated timetabling III, third international conference, PATAT 2000, Konstanz, Germany, 16-18 August, 2000. p. 109-23.
  • 12
    • 36348981532 scopus 로고    scopus 로고
    • R.J. Willemen, School timetable construction: algorithms and complexity. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 2002.
  • 13
    • 77956263702 scopus 로고    scopus 로고
    • Banks D, van Beek P, Meisels A. A heuristic incremental modelling approach to course timetabling. Proceedings of the 12th Canadian conference on artificial intelligence, 1998. p. 16-29.
  • 14
    • 21844484112 scopus 로고
    • Class scheduling to maximize participant satisfaction
    • Sampson S.E., Freeland J.R., and Weiss E.N. Class scheduling to maximize participant satisfaction. Interfaces 25 3 (1995) 30-41
    • (1995) Interfaces , vol.25 , Issue.3 , pp. 30-41
    • Sampson, S.E.1    Freeland, J.R.2    Weiss, E.N.3
  • 15
    • 0037740261 scopus 로고
    • Computerised decision aid for timetabling-a case analysis
    • Tripathy A. Computerised decision aid for timetabling-a case analysis. Discrete Applied Mathematics 35 (1992) 313-323
    • (1992) Discrete Applied Mathematics , vol.35 , pp. 313-323
    • Tripathy, A.1
  • 16
    • 36348994245 scopus 로고    scopus 로고
    • van Kesteren B. The clustering problem in Dutch High Schools: changing metrics in search space. Masters thesis, Leiden University, The Netherlands, 1999.
  • 18
    • 36349013654 scopus 로고    scopus 로고
    • Merlot LTG. Techniques for academic timetabling. PhD thesis, University of Melbourne, Australia, 2005.


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