Distribution requirements and compactness constraints in school timetabling

DOI10.1016/S0377-2217(96)00209-3zbMath0948.90157MaRDI QIDQ1291590

Frank Salewski, Andreas Drexl

Publication date: 21 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmstimetablingmultiple modesmode identitycompactness constraintsdistribution requirementsgreedy randomized algorithmspartially renewable resurces

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ Efficient solutions for a university timetabling problem through integer programming ⋮ School timetabling for quality student and teacher schedules ⋮ A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints ⋮ Cyclic transfers in school timetabling ⋮ An integer programming formulation for a case study in university timetabling. ⋮ A survey of school timetabling research ⋮ Preference-based assignment of university students to multiple teaching groups ⋮ Towards constraint-based school timetabling ⋮ A column generation approach to high school timetabling modeled as a multicommodity flow problem ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Distribution requirements and compactness constraints in school timetabling ⋮ ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Tabu search for large scale timetabling problems
• Timetabling problem for university as assignment of activities to resources
• A large scale timetabling problem
• An existential problem of a weight-controlled subset and its application to school timetable construction
• An interactive system for constructing timetables on a PC
• A classroom/time assignment model
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Exchanges procedures for timetabling problems
• Finding a feasible course schedule using Tabu search
• A logic approach to the resolution of constraints in timetabling
• A survey of algorithms for the generalized assignment problem
• Scheduling examinations to reduce second-order conflicts
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• Distribution requirements and compactness constraints in school timetabling
• A tabu search algorithm for computing an operational timetable
• Evolution based learning in a job shop scheduling environment
• Semi-greedy heuristics: An empirical study
• On representatives of multi-index transportation problems
• Project Scheduling Under Partially Renewable Resource Constraints
• Scheduling of Project Networks by Job Assignment
• A Lagrangean Relaxation Approach to Course Timetabling
• Tabu Search—Part I
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
• Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Constructing Good Solutions for the Spanish School Timetabling Problem