Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems

DOI10.1007/978-3-642-02026-1_44MaRDI QIDQ3637093zbMATH OpenOpenAlexWikidataFDO

Authors Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong Qu

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_44

zbMATH Keywords

schedulingexamination timetablinggraph colouring heuristicsroulette wheel selection

Mathematics Subject Classification ID

Applications of graph theory (05C90) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A graph coloring algorithm for large scale scheduling problems
• Linear combinations of heuristics for examination timetabling
• Solving examination timetabling problems through adaption of heuristic orderings
• scientific article; zbMATH DE number 1728534
• scientific article; zbMATH DE number 1728536

Cited in

(2)

• A review of hyper-heuristics for educational timetabling
• A practical three‐phase ILP approach for solving the examination timetabling problem

This page was built for publication: Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems

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