|
Case-Based Reasoning in Scheduling: Reusing Solution Components |
Cunningham, Padraig; Smyth, Barry
|
|
|
|
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.
|
|
Keyword(s):
|
Computer Science |
Publication Date:
|
1996 |
|
Type:
|
Report |
|
Peer-Reviewed:
|
Unknown |
|
Language(s):
|
English |
|
Institution:
|
Trinity College Dublin |
|
Citation(s):
|
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 |
|
Publisher(s):
|
Trinity College Dublin, Department of Computer Science |
|
File Format(s):
|
application/pdf |
|
First Indexed:
2014-05-13 05:39:57 Last Updated:
2015-04-10 05:10:06 |
