A language for specifying complete timetabling problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1452997
- Interval-based language for modeling scheduling problems: an extension to constraint programming
- Answer set programming as a modeling language for course timetabling
- Applications of scheduling theory to formal language theory
- Formal languages for integer programming modeling of shift scheduling problems
- A constraint-based approach to the timetabling problem
- Complexity of some special types of timetabling problems
- A logic approach to the resolution of constraints in timetabling
- Programmed search in a timetabling problem over finite domains
- Constraint logic programming for examination timetabling
Cited in
(9)- Using tabu search with longer-term memory and relaxation to create examination timetables.
- An XML format for benchmarks in high school timetabling
- Formal languages for integer programming modeling of shift scheduling problems
- Modelling timetabling problems with STTL
- A survey of school timetabling research
- Relational construction of specific timetables
- Towards an XML-based standard for timetabling problems: TTML
- Relation-algebraic specification and solution of special university timetabling problems
- A survey of search methodologies and automated system development for examination timetabling
This page was built for publication: A language for specifying complete timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2779820)