Some combinatorial models for course scheduling
Data up to Jan 2025
Total Citations Per Year
Abstract
References (22)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Tabu Search
1997 • 5,915 citations
Tabu Search—Part II
1990 • 5,665 citations
Tabu Search—Part I
1989 • 4,603 citations
On the Complexity of Timetable and Multicommodity Flow Problems
1976 • 1,045 citations
An introduction to timetabling
1985 • 587 citations
Annals of Discrete Mathematics
1982 • 505 citations
Methods of Operations Research.
1952 • 496 citations
Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms
1991 • 294 citations
Tabu search techniques
1989 • 222 citations
Tabu search for large scale timetabling problems
1991 • 210 citations
Recent developments in practical examination timetabling
1996 • 183 citations
A tabu search algorithm for computing an operational timetable
1994 • 174 citations
Two solutions to the general timetable problem using evolutionary methods
2002 • 56 citations
A constraint-based approach to high-school timetabling problems: a case study
1994 • 31 citations
Graphs, hypergraphs and timetabling
1985 • 22 citations
Restrictions and preassignments in preemptive open shop scheduling
1996 • 19 citations
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
1992 • 15 citations
Edge-Chromatic Scheduling with Simultaneity Constraints
1993 • 12 citations
The cyclic compact open-shop scheduling problem
1993 • 8 citations
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
1993 • 6 citations
Deleted Work
1955 • 0 citations