Name: | Description: | Size: | Format: | |
---|---|---|---|---|
1.22 MB | Adobe PDF |
Advisor(s)
Abstract(s)
The scheduling problem is considered in complexity
theory as a NP-hard combinatorial optimization problem.
Meta-heuristics proved to be very useful in the resolution of
this class of problems. However, these techniques require
parameter tuning which is a very hard task to perform. A
Case-based Reasoning module is proposed in order to solve the
parameter tuning problem in a Multi-Agent Scheduling
System. A computational study is performed in order to
evaluate the proposed CBR module performance.
Description
Keywords
Case-based reasoning Learning Meta-heuristics Parameter tuning Scheduling