Hybrid genetic algorithms for timetabling

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-111X(199608)11:8<477::AID-INT1>3.0.CO;2-I" /><477::AID-INT1>3.0.CO;2-I 10.1002/(SICI)1098-111X(199608)11:8<477::AID-INT1>3.0.CO;2-IzbMath0853.68104OpenAlexW2045846276MaRDI QIDQ4894218

Angelo Monfroglio

Publication date: 1 October 1996

Full work available at URL: https://doi.org/10.1002/(sici)1098-111x(199608)11:8<477::aid-int1>3.0.co;2-i

zbMATH Keywords

NP-hardhybrid genetic algorithmstimetabling problemdeterministic polynomial time algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (2)

Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines ⋮ A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university

This page was built for publication: Hybrid genetic algorithms for timetabling