The combinatorics of timetabling
From MaRDI portal
Publication:1278524
DOI10.1016/S0377-2217(96)00111-7zbMath0917.90190OpenAlexW1988376894MaRDI QIDQ1278524
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00111-7
Related Items (19)
A stochastic local search algorithm with adaptive acceptance for high-school timetabling ⋮ Efficient solutions for a university timetabling problem through integer programming ⋮ School timetabling for quality student and teacher schedules ⋮ Operational research in education ⋮ Coloration de graphes : fondements et applications ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ A computational study of a cutting plane algorithm for university course timetabling ⋮ A greedy-based neighborhood search approach to a nurse rostering problem. ⋮ A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. ⋮ An integer programming formulation for a case study in university timetabling. ⋮ A computational study of local search algorithms for Italian high-school timetabling ⋮ A comparative study of modern heuristics on the school timetabling problem ⋮ Programação da grade de horário em escolas de ensino fundamental e médio ⋮ Implementation of a university course and examination timetabling system ⋮ Disjoint congruence classes and a timetabling application ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy ⋮ Modeling and solving a real-life assignment problem at universities ⋮ Complexity of some special types of timetabling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The cyclic compact open-shop scheduling problem
- An introduction to timetabling
- Tabu search for large scale timetabling problems
- Tabu search techniques. A tutorial and an application to neural networks
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- Precoloring extension. I: Interval graphs
- Extensions of coloring models for scheduling purposes
- Constructing a course schedule by solving a series of assignment type problems
- A tabu search algorithm for computing an operational timetable
- Restricted coloring models for timetabling
- Preassignment requirements in chromatic scheduling
- Restrictions and preassignments in preemptive open shop scheduling
- Extending an edge-coloring
- School Timetables
- Tabu Search—Part I
- On the Complexity of Timetable and Multicommodity Flow Problems
- Edge-Chromatic Scheduling with Simultaneity Constraints
This page was built for publication: The combinatorics of timetabling
