A Lagrangean Relaxation Approach to Course Timetabling

DOI10.2307/2580848MaRDI QIDQ3873893zbMATH OpenOpenAlexFDO

Authors 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

algorithmbranch and bound procedureLagrangean relaxationlarge scale problemstime table scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(10)

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

This page was built for publication: A Lagrangean Relaxation Approach to Course Timetabling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873893)