Constructing a course schedule by solving a series of assignment type problems
From MaRDI portal
Publication:1296794
DOI10.1016/S0377-2217(97)00097-0zbMATH Open0936.90025OpenAlexW2092298566MaRDI QIDQ1296794FDOQ1296794
Authors: Alain Hertz, Vincent Robert 
Publication date: 3 August 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(97)00097-0
Recommendations
- Timetabling problem for university as assignment of activities to resources
- Resource-Constrained Assignment Scheduling
- Solving a real constraint satisfaction model for the university course timetabling problem: a case study
- scientific article; zbMATH DE number 953073
- scientific article; zbMATH DE number 1728532
Cites Work
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Title not available (Why is that?)
- A survey of algorithms for the generalized assignment problem
- Tabu Search—Part I
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Finding a feasible course schedule using Tabu search
- Tabu search for large scale timetabling problems
- A branch and bound algorithm for the generalized assignment problem
- Tabu Search—Part II
- Solving the maximum clique problem using a tabu search approach
- A tabu search algorithm for computing an operational timetable
- A Lagrangean Relaxation Approach to Course Timetabling
- An introduction to timetabling
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Scheduling to Minimize Interaction Cost
- Exchanges procedures for timetabling problems
- Tabu search techniques. A tutorial and an application to neural networks
- A classroom/time assignment model
- An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
Cited In (8)
- A direct barter model for course add/drop process
- New integer linear programming approaches for course timetabling
- A survey of school timetabling research
- Fuzzy robust courses scheduling problem
- The combinatorics of timetabling
- Operational research in education
- Modeling and solving a real-life assignment problem at universities
- Profile-assisted instruction scheduling
Uses Software
This page was built for publication: Constructing a course schedule by solving a series of assignment type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296794)
