메뉴 건너뛰기




Volumn 53, Issue , 2015, Pages 42-53

Integer programming methods for large-scale practical classroom assignment problems

Author keywords

Classroom assignment; Integer programming; Lexicographic optimisation; University course timetabling

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; SCHEDULING; TEACHING;

EID: 84906826211     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.07.012     Document Type: Article
Times cited : (49)

References (31)
  • 1
    • 84885710326 scopus 로고    scopus 로고
    • Curriculum-based course timetabling with SAT and MaxSAT
    • FEBRUARY
    • R. Asín Achá, and R. Nieuwenhuis Curriculum-based course timetabling with SAT and MaxSAT Ann Oper Res February 2002 1 21
    • (2002) Ann Oper Res , pp. 1-21
    • Asín Achá, R.1    Nieuwenhuis, R.2
  • 2
    • 26644466566 scopus 로고    scopus 로고
    • A computational study of a cutting plane algorithm for university course timetabling
    • DOI 10.1007/s10951-005-4780-1
    • P. Avella, and I. Vasil'Ev A computational study of a cutting plane algorithm for university course timetabling J Sched 8 6 2005 497 514 (Pubitemid 41442641)
    • (2005) Journal of Scheduling , vol.8 , Issue.6 , pp. 497-514
    • Avella, P.1    Vasil'ev, I.2
  • 3
    • 84861233163 scopus 로고    scopus 로고
    • Design and statistical analysis of a hybrid local search algorithm for course timetabling
    • R. Bellio, L. Di Gaspero, and A. Schaerf Design and statistical analysis of a hybrid local search algorithm for course timetabling J Sched 15 1 2012 49 61
    • (2012) J Sched , vol.15 , Issue.1 , pp. 49-61
    • Bellio, R.1    Di Gaspero, L.2    Schaerf, A.3
  • 4
    • 0004650626 scopus 로고
    • Balanced matrices
    • C. Berge Balanced matrices Math Program 2 1 1972 19 31
    • (1972) Math Program , vol.2 , Issue.1 , pp. 19-31
    • Berge, C.1
  • 6
    • 84857455006 scopus 로고    scopus 로고
    • Benchmarking curriculum-based course timetabling formulations, data formats, instances, validation, visualization, and results
    • A. Bonutti, F. De Cesco, L. Di Gaspero, and A. Schaerf Benchmarking curriculum-based course timetabling formulations, data formats, instances, validation, visualization, and results Ann Oper Res 194 1 2012 59 70
    • (2012) Ann Oper Res , vol.194 , Issue.1 , pp. 59-70
    • Bonutti, A.1    De Cesco, F.2    Di Gaspero, L.3    Schaerf, A.4
  • 9
    • 70349279898 scopus 로고    scopus 로고
    • Decomposition, reformulation, and diving in university course timetabling
    • E.K. Burke, J. Mareček, A.J. Parkes, and H. Rudová Decomposition, reformulation, and diving in university course timetabling Comput Oper Res 37 3 2010 582 597
    • (2010) Comput Oper Res , vol.37 , Issue.3 , pp. 582-597
    • Burke, E.K.1    Mareček, J.2    Parkes, A.J.3    Rudová, H.4
  • 10
    • 17144420325 scopus 로고
    • A Lagrangian relaxation approach to the classroom assignment problem
    • M.W. Carter A Lagrangian relaxation approach to the classroom assignment problem INFORMS J Comput 27 2 1989 230 246
    • (1989) INFORMS J Comput , vol.27 , Issue.2 , pp. 230-246
    • Carter, M.W.1
  • 11
    • 0005284309 scopus 로고
    • When is the classroom assignment problem hard?
    • M.W. Carter, and C.A. Tovey When is the classroom assignment problem hard? Oper Res 40 1992 S28 S39
    • (1992) Oper Res , vol.40
    • Carter, M.W.1    Tovey, C.A.2
  • 12
    • 33746294633 scopus 로고    scopus 로고
    • Classroom assignment for exam timetabling
    • DOI 10.1016/j.advengsoft.2006.02.001, PII S0965997806000202
    • A. Dammak, A. Elloumi, and H. Kamoun Classroom assignment for exam timetabling Adv Eng Softw 37 10 2006 659 666 (Pubitemid 44108647)
    • (2006) Advances in Engineering Software , vol.37 , Issue.10 , pp. 659-666
    • Dammak, A.1    Elloumi, A.2    Kamoun, H.3
  • 15
    • 84889094717 scopus 로고    scopus 로고
    • The classroom assignment problem complexity, size reduction and heuristics
    • A. Elloumi, H. Kamoun, B. Jarboui, and A. Dammak The classroom assignment problem complexity, size reduction and heuristics Appl Soft Comput 14 Part C 2014 677 686
    • (2014) Appl Soft Comput , vol.14 , Issue.PART C , pp. 677-686
    • Elloumi, A.1    Kamoun, H.2    Jarboui, B.3    Dammak, A.4
  • 16
    • 0007902882 scopus 로고
    • A decision support system for assigning classes to rooms
    • C.R. Glassey, and M. Mizrach A decision support system for assigning classes to rooms Interfaces 16 5 1986 92 100
    • (1986) Interfaces , vol.16 , Issue.5 , pp. 92-100
    • Glassey, C.R.1    Mizrach, M.2
  • 17
    • 0022736593 scopus 로고
    • Allocation of classrooms by linear programming
    • K. Gosselin, and M. Truchon Allocation of classrooms by linear programming J Oper Res Soc 37 6 1986 561 569
    • (1986) J Oper Res Soc , vol.37 , Issue.6 , pp. 561-569
    • Gosselin, K.1    Truchon, M.2
  • 18
    • 84867028133 scopus 로고    scopus 로고
    • Gurobi Optimization, Inc.
    • Gurobi Optimization, Inc., Gurobi optimizer reference manual, http://www.gurobi.com ; 2013.
    • (2013) Gurobi Optimizer Reference Manual
  • 20
    • 45449087055 scopus 로고    scopus 로고
    • Optimal university course timetables and the partial transversal polytope
    • McGeoch CC, editor WEA'08. Berlin: Springer
    • Lach G, Lübbecke ME. Optimal university course timetables and the partial transversal polytope. In: McGeoch CC, editor. Proceedings of the 7th international conference on experimental algorithms. WEA'08. Berlin: Springer; 2008. p. 235-48.
    • (2008) Proceedings of the 7th International Conference on Experimental Algorithms , pp. 235-248
    • Lach Lübbecke G, M.E.1
  • 21
    • 84857457732 scopus 로고    scopus 로고
    • Curriculum based course timetabling new solutions to Udine benchmark instances
    • G. Lach, and M.E. Lübbecke Curriculum based course timetabling new solutions to Udine benchmark instances Ann Oper Res 194 1 2012 255 272
    • (2012) Ann Oper Res , vol.194 , Issue.1 , pp. 255-272
    • Lach, G.1    Lübbecke, M.E.2
  • 22
    • 77949417352 scopus 로고    scopus 로고
    • Setting the research agenda in automated timetabling the second international timetabling competition
    • B. McCollum, A. Schaerf, B. Paechter, P. McMullan, R. Lewis, and A.J. Parkes et al. Setting the research agenda in automated timetabling the second international timetabling competition INFORMS J Comput 22 1 2010 120 130
    • (2010) INFORMS J Comput , vol.22 , Issue.1 , pp. 120-130
    • McCollum, B.1    Schaerf, A.2    Paechter, B.3    McMullan, P.4    Lewis, R.5    Parkes, A.J.6
  • 23
    • 84878522514 scopus 로고    scopus 로고
    • Solution approaches to the course timetabling problem
    • S. MirHassani, and F. Habibi Solution approaches to the course timetabling problem Artif Intell Rev 39 2 2013 133 149
    • (2013) Artif Intell Rev , vol.39 , Issue.2 , pp. 133-149
    • Mirhassani, S.1    Habibi, F.2
  • 24
    • 0242494406 scopus 로고    scopus 로고
    • A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
    • S. Mirrazavi, S. Mardle, and M. Tamiz A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies J Oper Res Soc 54 11 2003 1155 1166
    • (2003) J Oper Res Soc , vol.54 , Issue.11 , pp. 1155-1166
    • Mirrazavi, S.1    Mardle, S.2    Tamiz, M.3
  • 25
    • 72249111115 scopus 로고    scopus 로고
    • ITC2007 solver description a hybrid approach
    • T. Müller ITC2007 solver description a hybrid approach Ann Oper Res 172 1 2009 429 446
    • (2009) Ann Oper Res , vol.172 , Issue.1 , pp. 429-446
    • Müller, T.1
  • 29
    • 0024031588 scopus 로고
    • On the integer properties of scheduling set partitioning models
    • DOI 10.1016/0377-2217(88)90233-0
    • D.M. Ryan, and J.C. Falkner On the integer properties of scheduling set partitioning models Eur J Oper Res 35 3 1988 442 456 (Pubitemid 18618657)
    • (1988) European Journal of Operational Research , vol.35 , Issue.3 , pp. 442-456
    • Ryan, D.M.1    Falkner, J.C.2
  • 30
    • 34547212268 scopus 로고    scopus 로고
    • Application of a real-world university-course timetabling model solved by integer programming
    • K. Schimmelpfeng, and S. Helber Application of a real-world university-course timetabling model solved by integer programming OR Spectr 29 4 2007 783 803
    • (2007) OR Spectr , vol.29 , Issue.4 , pp. 783-803
    • Schimmelpfeng, K.1    Helber, S.2


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