\textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming

DOI10.1007/S10479-018-2757-7zbMath1434.90049OpenAlexW2790306361MaRDI QIDQ1730740

Benjamin Kaufmann, Naoyuki Tamura, Tenda Okimoto, Torsten Schaub, Mutsunori Banbara, Philipp Wanko, Katsumi Inoue, Takehide Soh

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2757-7

zbMATH Keywords

multi-objective optimizationanswer set programmingeducational timetablingcourse timetablingminimal perturbation problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming

Uses Software

• clasp
• SMAC
• teaspoon
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• SAT-based MaxSAT algorithms
• Survey of multi-objective optimization methods for engineering
• A supernodal formulation of vertex colouring with applications in course timetabling
• Hybrid search for minimal perturbation in dynamic CSPs
• Decomposition, reformulation, and diving in university course timetabling
• Probe backtrack search for minimal perturbation in dynamic scheduling
• Recent research directions in automated timetabling
• maxSAT-based large neighborhood search for high school timetabling
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• A branch-and-cut procedure for the Udine course timetabling problem
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling
• Curriculum based course timetabling: new solutions to Udine benchmark instances
• Logic programs with stable model semantics as a constraint programming paradigm
• ITC2007 solver description: a hybrid approach
• An overview of curriculum-based course timetabling
• Adaptive tabu search for course timetabling
• A survey of metaheuristic-based techniques for university timetabling problems
• Neighborhood portfolio approach for local search applied to timetabling problems
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Progress in clasp Series 3
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving
• Multicriteria Optimization
• Unsatisfiability-based optimization in clasp
• Answer set programming as a modeling language for course timetabling

This page was built for publication: \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming