Show simple item record

dc.contributor.authorAhmadi, Samaden
dc.contributor.authorAbdullah, S.en
dc.contributor.authorBurke, E.en
dc.contributor.authorDror, M.en
dc.date.accessioned2008-11-24T13:57:21Z
dc.date.available2008-11-24T13:57:21Z
dc.date.issued2007-04-01en
dc.identifier.citationAhmadi, S. et al. (2007) Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. OR Spectrum, 29(2), pp. 351-372.
dc.identifier.issn1436-6304en
dc.identifier.urihttp://hdl.handle.net/2086/265
dc.descriptionThis has been a joint collaboration with the Universities of Arizona and Nottingham. It is one of the first implementations of very large neighbourhood structures. We extended the idea of large neighbourhoods to real instances of timetabling problems with a complex and interacting set of constraints. Discovery of the sequential moves used in our neighbourhood structure was from our innovative visual interface for timetabling problems (STARK). This interface has come out of our research with cognitive scientists at Nottingham University as part of an EPSRC funded project on humanising automated scheduling systems.en
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.subjectRAE 2008
dc.subjectUoA 23 Computer Science and Informatics
dc.titleInvestigating Ahuja-Orlin's large neighbourhood search approach for examination timetablingen
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1007/s00291-006-0034-7en
dc.researchgroupSoftware Technology Research Laboratory (STRL)


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record