SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

An effective hybrid algorithm for university course timetabling · Study

ArticleShelves

ArticleAn effective hybrid algorithm for university course timetabling

Marco Chiarandini2006

Article2006

An effective hybrid algorithm for university course timetabling

Marco Chiarandini · Mauro Birattari · Krzysztof Socha · Olivia Rossi-Doria

144 citations·0/0 files stored·Journal of Scheduling

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Metaheuristic Optimization Algorithms Research Constraint Satisfaction and Optimization

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 144 citations exist upstream.

References

1999A Survey of Automated Timetabling 1985An introduction to timetabling 2003A Tabu-Search Hyperheuristic for Timetabling and Rostering 2002Recent research directions in automated timetabling 1996Examination Timetabling: Algorithmic Strategies and Applications 1998Recent developments in practical course timetabling 1996A memetic algorithm for university exam timetabling 1998A robust simulated annealing based examination timetabling system

Cited by

2012University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm 2012Solving the post enrolment course timetabling problem by ant colony optimization 2011Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem 2010A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences 2015An overview of curriculum-based course timetabling 2010

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2006Case-based selection of initialisation heuristics for metaheuristic examination timetablingarticle · 11 shared references 2007Finding Feasible Timetables Using Group-Based Operatorsarticle · 9 shared references 2007Practice and Theory of Automated Timetabling VIother · 8 shared references 2007A Perspective on Bridging the Gap Between Theory and Practice in University Timetablingother · 8 shared references 2007Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problemchapter · 8 shared references 2007Metaheuristics for University Course Timetablingchapter · 8 shared references

Details

Year2006

Typearticle

Published2006-06-16

VenueJournal of Scheduling

ISSN-L1094-6136

Languageen

Citations144

Files0 public / 0

ShelfScheduling and Timetabling Solutions

Identifiers

doi10.1007/s10951-006-8495-8

openalex_workW2108432292

Links

Imported from OpenAlex (CC0) — nothing here is generated.

A hybrid metaheuristic approach to the university course timetabling problem

2010Neighborhood analysis: a case study on curriculum-based course timetabling

2007Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem