Construction of university faculty timetables using logic programming techniques

DOI10.1016/0166-218X(92)90246-7zbMath0800.90561MaRDI QIDQ1186311

G. Dollansky, Roland Fahrion

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Logic programming (68N17)

Related Items (3)

A MILP model for the teacher assignment problem considering teachers' preferences ⋮ Mathematical programming models and algorithms for a class--faculty assignment problem ⋮ A generalized class-teacher model for some timetabling problems

Cites Work

• Algorithms for finding in the lump both bounds of the chromatic number of a graph
• On A Particular Conference Scheduling Problem
• Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of university faculty timetables using logic programming techniques