Cyclic transfers in school timetabling
From MaRDI portal
Publication:421072
DOI10.1007/s00291-010-0227-yzbMath1238.90086OpenAlexW2037760125MaRDI QIDQ421072
Frederik Geertsema, Samad Ahmadi, Gerhard F. Post
Publication date: 23 May 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-010-0227-y
Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Related Items
Repairing high school timetables with polymorphic ejection chains ⋮ A survey of school timetabling research ⋮ Shift rostering using decomposition: assign weekend shifts first
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- An introduction to timetabling
- Tabu search for large scale timetabling problems
- Distribution requirements and compactness constraints in school timetabling
- On a multiconstrained model for chromatic scheduling
- Metaheuristics for high school timetabling
- Constraint programming approach for school timetabling.
- Recent research directions in automated timetabling
- Domination analysis of some heuristics for the traveling salesman problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Timetabling for Greek high schools
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Constructing Good Solutions for the Spanish School Timetabling Problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
