Using new metrics to find a good examination schedule

MaRDI QIDQ6557033zbMATH OpenFDO

Authors P. Arnot Smith, Ping Wang

Publication date 17 June 2024

Published in International Journal of Mathematics and Computer Science (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmsimulation annealing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Operations research and management science (90Bxx)

Recommendations

• SCHOOL SCHEDULING USING THRESHOLD ACCEPTING
• scientific article; zbMATH DE number 1866918
• Cognitive rhythms and evolutionary algorithms in university timetables scheduling
• Algorithmic design for the examination arrangement system on a large scale for universities
• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem

This page was built for publication: Using new metrics to find a good examination schedule

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