A Lagrangean Relaxation Approach to Course Timetabling

DOI10.2307/2580848zbMath0434.90046OpenAlexW4231080301MaRDI QIDQ3873893

Arabinda Tripathy

Publication date: 1980

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2580848

zbMATH Keywords

algorithmLagrangean relaxationbranch and bound procedurelarge scale problemstime table scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Operational research in education, A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem, A large scale timetabling problem, A classroom/time assignment model, Weighted graphs and university course timetabling, Finding a feasible course schedule using Tabu search, An introduction to timetabling, Distribution requirements and compactness constraints in school timetabling, Constructing a course schedule by solving a series of assignment type problems, Tabu search for large scale timetabling problems