Trinity College Dublin, Department of Computer Science
Cunningham, Pádraig; Smyth, Barry. 'Case-Based Reasoning in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-96-12, 1996, pp14
Computer Science Technical Report TCD-CS-96-12
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.
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.