The combinatorics of timetabling
type: Item
instance of: scholarly article
title: The combinatorics of timetabling
zbMATH Open document ID: 0917.90190
DOI: 10.1016/S0377-2217(96)00111-7
author: Dominique De Werra
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1253025
zbMATH Keywords: chromatic scheduling
zbMATH Keywords: hypergraph
zbMATH Keywords: Latin squares
zbMATH Keywords: timetabling
zbMATH Keywords: coloring problems in graphs
zbMATH Keywords: tabu search
MaRDI profile type: Publication
cites work: Q5615282
cites work: Precoloring extension. I: Interval graphs
cites work: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
cites work: A tabu search algorithm for computing an operational timetable
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: Constructing a course schedule by solving a series of assignment type problems
cites work: Tabu search for large scale timetabling problems
cites work: School Timetables
cites work: The cyclic compact open-shop scheduling problem
cites work: Extending an edge-coloring
cites work: Q3686417
cites work: An introduction to timetabling
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: Edge-Chromatic Scheduling with Simultaneity Constraints
cites work: Restrictions and preassignments in preemptive open shop scheduling
cites work: Preassignment requirements in chromatic scheduling
cites work: Extensions of coloring models for scheduling purposes
cites work: Restricted coloring models for timetabling
full work available at URL: s0377-2217(96)00111-7
OpenAlex ID: W1988376894
description: scientific article; zbMATH DE number 1253025