A logic approach to the resolution of constraints in timetabling

DOI10.1016/0377-2217(92)90360-LzbMath0757.90033MaRDI QIDQ1194718

Le Kang, George M. White

Publication date: 6 October 1992

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

zbMATH Keywords

expert systemslogic programmingtimetablesheuristic solutions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Efficient solutions for a university timetabling problem through integer programming ⋮ A bibliography of expert system applications for business (1984-1992) ⋮ A multi-objective course scheduling model: Combining faculty preferences for courses and times. ⋮ Using tabu search with longer-term memory and relaxation to create examination timetables. ⋮ An integer programming formulation for a case study in university timetabling. ⋮ Constraint programming approach for school timetabling. ⋮ A two-stage multiobjective scheduling model for [faculty-course-time assignments] ⋮ Distribution requirements and compactness constraints in school timetabling ⋮ The course scheduling problem at Lufthansa technical training ⋮ Modeling and solving a real-life assignment problem at universities ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem

Cites Work

• Unnamed Item
• An introduction to timetabling
• Timetabling problem for university as assignment of activities to resources
• A classroom/time assignment model
• Solving a cutting-stock problem with the constraint logic programming language CHIP
• A Lagrangian Relaxation Approach To The Classroom Assignment Problem^*
• On the Complexity of Timetable and Multicommodity Flow Problems
• New methods to color the vertices of a graph
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: A logic approach to the resolution of constraints in timetabling