CBR in Scheduling: Reusing Solution Components
Citation:
Cunningham, Padraig; Smyth, Barry. 'CBR in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-95-20, 1995, pp8Download Item:
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.
Author: Cunningham, Padraig; Smyth, Barry
Publisher:
Trinity College Dublin, Department of Computer ScienceType of material:
Technical ReportCollections
Series/Report no:
Computer Science Technical ReportTCD-CS-95-20
Availability:
Full text availableKeywords:
Computer ScienceMetadata
Show full item recordLicences: