Distribution requirements and compactness constraints in school timetabling
DOI10.1016/S0377-2217(96)00209-3zbMATH Open0948.90157MaRDI QIDQ1291590FDOQ1291590
Authors: Frank Salewski, Andreas Drexl
Publication date: 21 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
genetic algorithmstimetablingmode identitymultiple modescompactness constraintsdistribution requirementsgreedy randomized algorithmspartially renewable resurces
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)
Cites Work
- Title not available (Why is that?)
- A survey of algorithms for the generalized assignment problem
- Project Scheduling Under Partially Renewable Resource Constraints
- Tabu Search—Part I
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Title not available (Why is that?)
- Finding a feasible course schedule using Tabu search
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- Scheduling of Project Networks by Job Assignment
- Title not available (Why is that?)
- Tabu search for large scale timetabling problems
- A large scale timetabling problem
- Scheduling examinations to reduce second-order conflicts
- A tabu search algorithm for computing an operational timetable
- A Lagrangean Relaxation Approach to Course Timetabling
- Constructing Good Solutions for the Spanish School Timetabling Problem
- An introduction to timetabling
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Semi-greedy heuristics: An empirical study
- Distribution requirements and compactness constraints in school timetabling
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- Evolution based learning in a job shop scheduling environment
- On representatives of multi-index transportation problems
- Exchanges procedures for timetabling problems
- A classroom/time assignment model
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- Timetabling problem for university as assignment of activities to resources
- Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling
- An interactive system for constructing timetables on a PC
- A logic approach to the resolution of constraints in timetabling
Cited In (19)
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Cyclic transfers in school timetabling
- A survey of school timetabling research
- Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints
- School timetabling for quality student and teacher schedules
- A fix-and-optimize heuristic for the high school timetabling problem
- A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- Strong bounds with cut and column generation for class-teacher timetabling
- A grasp-knapsack hybrid for a nurse-scheduling problem
- Preference-based assignment of university students to multiple teaching groups
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- High quality timetables for Italian schools
- An integer programming formulation for a case study in university timetabling.
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
- Towards constraint-based school timetabling
- Efficient solutions for a university timetabling problem through integer programming
- Distribution requirements and compactness constraints in school timetabling
- A column generation approach to high school timetabling modeled as a multicommodity flow problem
Uses Software
This page was built for publication: Distribution requirements and compactness constraints in school timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291590)