|
CBR in Scheduling: Reusing Solution Components |
Cunningham, Padraig; Smyth, Barry
|
|
|
|
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.
|
|
Keyword(s):
|
Computer Science |
Publication Date:
|
1995 |
|
Type:
|
Report |
|
Peer-Reviewed:
|
Unknown |
|
Language(s):
|
English |
|
Institution:
|
Trinity College Dublin |
|
Citation(s):
|
Cunningham, Padraig; Smyth, Barry. 'CBR in Scheduling: Reusing Solution Components'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-95-20, 1995, pp8 |
|
Publisher(s):
|
Trinity College Dublin, Department of Computer Science |
|
File Format(s):
|
application/pdf |
|
First Indexed:
2014-05-13 05:32:23 Last Updated:
2015-04-10 05:14:14 |
