Show simple item record

dc.contributor.authorCunningham, Padraig
dc.contributor.authorSmyth, Barry
dc.date.accessioned2007-12-19T10:42:26Z
dc.date.available2007-12-19T10:42:26Z
dc.date.issued1996-08
dc.identifier.citationCunningham, Padraig; Smyth, Barry. 'Case-Based Reasoning in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-96-12, 1996, pp14en
dc.identifier.otherTCD-CS-96-12
dc.identifier.urihttp://hdl.handle.net/2262/12899
dc.description.abstractIn this paper we explore the reuse of components of known good schedules in new scheduling problems. This involves accumulating a case-base of good quality schedules, retrieving a case (or cases) similar to a new scheduling problem and building a new schedule from components of the retrieved cases. We start by introducing the components of Case-Based Reasoning (CBR) and we describe a CBR solution to a Travelling Salesman Problem in order to illustrate the use of CBR in optimisation problems. Two CBR solutions to a single machine scheduling problem with sequence dependent setup times are described. These are evaluated by comparing them with two more conventional alternative techniques ? simulated annealing and myopic search. Both CBR techniques are shown to provide good quality solutions quickly.en
dc.format.extent104411 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherTrinity College Dublin, Department of Computer Scienceen
dc.relation.ispartofseriesComputer Science Technical Reporten
dc.relation.ispartofseriesTCD-CS-96-12en
dc.relation.haspartTCD-CS-[no.]en
dc.subjectComputer Scienceen
dc.titleCase-Based Reasoning in Scheduling: Reusing Solution Componentsen
dc.typeComputer Science Technical Reporten
dc.identifier.rssurihttps://www.cs.tcd.ie/publications/tech-reports/reports.96/TCD-CS-96-12.pdf


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record