Case-Based Reasoning in Scheduling: Reusing Solution Components
P. Cunningham, and B. Smyth. International Journal for Production Research, 35 (11):
2947--2961(1996)http://www.cs.ucd.ie/staff/bsmyth/home/crc/jpr97.doc Last access: 2003-06-25.
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. 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.
%0 Journal Article
%1 CunninghamSmyth96
%A Cunningham, Pádraig
%A Smyth, Barry
%D 1996
%J International Journal for Production Research
%K barry-smyth imported,
%N 11
%P 2947--2961
%T Case-Based Reasoning in Scheduling: Reusing Solution Components
%V 35
%X 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.
@article{CunninghamSmyth96,
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. 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.},
added-at = {2007-11-02T23:45:09.000+0100},
author = {Cunningham, P{\'a}draig and Smyth, Barry},
biburl = {https://www.bibsonomy.org/bibtex/230f307d5698708adce7f90852d337ea2/bsmyth},
interhash = {50bd951591b3dc2802788240c1dc9164},
intrahash = {30f307d5698708adce7f90852d337ea2},
journal = {International Journal for Production Research},
keywords = {barry-smyth imported,},
note = {\url{http://www.cs.ucd.ie/staff/bsmyth/home/crc/jpr97.doc} [Last access: 2003-06-25]},
number = 11,
pages = {2947--2961},
timestamp = {2007-11-05T13:03:06.000+0100},
title = {Case-Based Reasoning in Scheduling: Reusing Solution Components},
volume = 35,
year = 1996
}