dc.contributor.author | Cunningham, Padraig | |
dc.contributor.author | Smyth, Barry | |
dc.date.accessioned | 2007-12-19T10:42:26Z | |
dc.date.available | 2007-12-19T10:42:26Z | |
dc.date.issued | 1996-08 | |
dc.identifier.citation | Cunningham, Padraig; Smyth, Barry. 'Case-Based Reasoning in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-96-12, 1996, pp14 | en |
dc.identifier.other | TCD-CS-96-12 | |
dc.description.abstract | In 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.extent | 104411 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Trinity College Dublin, Department of Computer Science | en |
dc.relation.ispartofseries | Computer Science Technical Report | en |
dc.relation.ispartofseries | TCD-CS-96-12 | en |
dc.relation.haspart | TCD-CS-[no.] | en |
dc.subject | Computer Science | en |
dc.title | Case-Based Reasoning in Scheduling: Reusing Solution Components | en |
dc.type | Computer Science Technical Report | en |
dc.identifier.rssuri | https://www.cs.tcd.ie/publications/tech-reports/reports.96/TCD-CS-96-12.pdf | |
dc.identifier.uri | http://hdl.handle.net/2262/12899 | |