The balanced academic curriculum problem revisited

DOI10.1007/s10732-011-9158-2zbMath1358.90113OpenAlexW2073608039MaRDI QIDQ519088

Andrea Schaerf, Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi

Publication date: 4 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-011-9158-2

zbMATH Keywords

combinatorial optimizationlocal searchtimetablingmetaheuristic methodologies

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A new mixed integer programming model for curriculum balancing: application to a Turkish university ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ Exact and meta-heuristic approaches for the production leveling problem ⋮ Measures of balance in combinatorial optimization ⋮ The generalized balanced academic curriculum problem with heterogeneous classes

Uses Software

• BACP
• EasyLocal++
• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Neighborhood portfolio approach for local search applied to timetabling problems
• SPREAD: A Balancing Constraint Based on Statistics
• The Deviation Constraint
• Multicriteria Optimization