dc.contributor.author | Cunningham, Padraig | en |
dc.contributor.author | Smyth, Barry | |
dc.date.accessioned | 2007-12-18T11:09:39Z | |
dc.date.available | 2007-12-18T11:09:39Z | |
dc.date.issued | 1995-06 | |
dc.identifier.citation | Cunningham, Padraig; Smyth, Barry. 'CBR in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-95-20, 1995, pp8 | en |
dc.identifier.other | TCD-CS-95-20 | |
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.
Two CBR solutions to a single machine scheduling problem with schedule
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 and significant time improvements over simulated annealing. | en |
dc.format.extent | 32245 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-95-20 | en |
dc.relation.haspart | TCD-CS-[no.] | en |
dc.subject | Computer Science | en |
dc.title | CBR in Scheduling: Reusing Solution Components | en |
dc.type | Technical Report | en |
dc.identifier.rssuri | https://www.cs.tcd.ie/publications/tech-reports/reports.95/TCD-CS-95-20.pdf | |
dc.identifier.uri | http://hdl.handle.net/2262/12863 | |