Extended clique initialisation in examination timetabling

DOI10.1057/PALGRAVE.JORS.2601115MaRDI QIDQ4658438zbMATH OpenOpenAlexFDO

Authors

Publication date 16 March 2005

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

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601115

zbMATH Keywords

graphcliquetimetabling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A clique-based algorithm for constructing feasible timetables
• scientific article; zbMATH DE number 1728535
• scientific article; zbMATH DE number 1728534
• Linear combinations of heuristics for examination timetabling
• A clique search problem and its application to machine scheduling
• A dynamic programming approach for timing and designing clique algorithms
• An integer programming approach to curriculum-based examination timetabling
• scientific article; zbMATH DE number 2170482
• Batch Scheduling with Time Restriction and Clique Search

Cited in

(5)

• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• A survey of search methodologies and automated system development for examination timetabling
• Operational research in education
• A multi-objective evolutionary algorithm for examination timetabling
• A review on algorithms for maximum clique problems

This page was built for publication: Extended clique initialisation in examination timetabling

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