Trinity College Dublin, Department of Computer Science
Cunningham, Pádraig; Smyth, Barry. 'CBR in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-95-20, 1995, pp8
Computer Science Technical Report TCD-CS-95-20
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.
Please note: There is a known bug in some browsers that causes an
error when a user tries to view large pdf file within the browser window.
If you receive the message "The file is damaged and could not be
repaired", please try one of the solutions linked below based on the
browser you are using.
Items in TARA are protected by copyright, with all rights reserved, unless otherwise indicated.