Constructing a course schedule by solving a series of assignment type problems
type: Item
instance of: scholarly article
title: Constructing a course schedule by solving a series of assignment type problems
zbMATH Open document ID: 0936.90025
DOI: 10.1016/S0377-2217(97)00097-0
author: Alain Hertz
author: Vincent Robert
published in: European Journal of Operational Research
publication date: 1999-08-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1320326
zbMATH Keywords: constrained course scheduling
describes a project that uses: TABARIS
MaRDI profile type: Publication
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: Scheduling to Minimize Interaction Cost
cites work: A survey of algorithms for the generalized assignment problem
cites work: A tabu search algorithm for computing an operational timetable
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Exchanges procedures for timetabling problems
cites work: An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
cites work: Q4198056
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Tabu search for large scale timetabling problems
cites work: Finding a feasible course schedule using Tabu search
cites work: A classroom/time assignment model
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: A Lagrangean Relaxation Approach to Course Timetabling
cites work: An introduction to timetabling
cites work: Tabu search techniques. A tutorial and an application to neural networks
full work available at URL: s0377-2217(97)00097-0
OpenAlex ID: W2092298566
description: scientific article; zbMATH DE number 1320326