Setting the research agenda in automated timetabling: the second international timetabling competition
DOI10.1287/IJOC.1090.0320zbMATH Open1243.90007DBLPjournals/informs/McCollumSPMLPGQB10OpenAlexW2028379670WikidataQ57968718 ScholiaQ57968718MaRDI QIDQ2899043FDOQ2899043
Authors: Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhyd Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1090.0320
Recommendations
- The third international timetabling competition
- A new model for automated examination timetabling
- An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
- Recent research directions in automated timetabling
- Solving the international timetabling competition: a deterministic approach
Deterministic scheduling theory in operations research (90B35) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (74)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Practices in timetabling in higher education institutions: a systematic review
- An overview of curriculum-based course timetabling
- An investigation into two bin packing problems with ordering and orientation implications
- A review of hyper-heuristics for educational timetabling
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- Fairness in academic course timetabling
- The practice and theory of automated timetabling (2012)
- The third international timetabling competition
- Effective learning hyper-heuristics for the course timetabling problem
- A survey of school timetabling research
- Adaptive selection of heuristics for improving exam timetables
- The first international nurse rostering competition 2010
- XHSTT: an XML archive for high school timetabling problems in different countries
- Local search and lower bounds for the patient admission scheduling problem
- An assignment problem and its application in education domain: a review and potential path
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- Finding happiness: an analysis of the maximum happy vertices problem
- A survey of search methodologies and automated system development for examination timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
- A step counting hill climbing algorithm applied to university examination timetabling
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
- The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge
- Memetic techniques for examination timetabling
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- Integer programming methods for large-scale practical classroom assignment problems
- Hybrid bee colony optimization for examination timetabling problems
- A branch-and-cut procedure for the Udine course timetabling problem
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Monte Carlo hyper-heuristics for examination timetabling
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- Preprocessing and an improved MIP model for examination timetabling
- A new model for curriculum-based university course timetabling
- A new lower bound for curriculum-based course timetabling
- Mathematical models and algorithms for a high school timetabling problem
- Exact and metaheuristic methods for a real-world examination timetabling problem
- Robust university course timetabling problem subject to single and multiple disruptions
- Flow formulations for curriculum-based course timetabling
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- Measuring instance difficulty for combinatorial optimization problems
- Solving the post enrolment course timetabling problem by ant colony optimization
- Preface: The practice and theory of automated timetabling (2018)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- Answer set programming as a modeling language for course timetabling
- The late acceptance hill-climbing heuristic
- Solving the examination timetabling problem in GPUs
- The generalized balanced academic curriculum problem with heterogeneous classes
- Automated generation of constructive ordering heuristics for educational timetabling
- An integer programming approach to curriculum-based examination timetabling
- Benders decomposition for curriculum-based course timetabling
- A harmony search algorithm for university course timetabling
- A new model for automated examination timetabling
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- An adaptive flex-deluge approach to university exam timetabling
- A cellular memetic algorithm for the examination timetabling problem
- The second international nurse rostering competition
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- A matheuristic for customized multi-level multi-criteria university timetabling
- Patient scheduling in hemodialysis service
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- The international timetabling competition on sports timetabling (ITC2021)
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- Tackling the maximum happy vertices problem in large networks
- Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions
- Consensus-finding that preserves mutually conflicting hypothetical information from a same agent
- A university-wide orientation course timetabling model and its modification for pandemic period
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
This page was built for publication: Setting the research agenda in automated timetabling: the second international timetabling competition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899043)