Constructing a course schedule by solving a series of assignment type problems

DOI10.1016/S0377-2217(97)00097-0MaRDI QIDQ1296794zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constrained course scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Lagrangean Relaxation Approach to Course Timetabling
• A branch and bound algorithm for the generalized assignment problem
• A classroom/time assignment model
• A survey of algorithms for the generalized assignment problem
• A tabu search algorithm for computing an operational timetable
• An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
• An introduction to timetabling
• Exchanges procedures for timetabling problems
• Finding a feasible course schedule using Tabu search
• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Scheduling to Minimize Interaction Cost
• Solving the maximum clique problem using a tabu search approach
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu search for large scale timetabling problems
• Tabu search techniques. A tutorial and an application to neural networks
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(8)

• New integer linear programming approaches for course timetabling
• Fuzzy robust courses scheduling problem
• Profile-assisted instruction scheduling
• Modeling and solving a real-life assignment problem at universities
• Operational research in education
• A survey of school timetabling research
• A direct barter model for course add/drop process
• The combinatorics of timetabling

Describes a project that uses

Uses Software

• TABARIS

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)