Name
Abstract | ||
|---|---|---|
The maintenance scheduling problem has been previously tackled by various traditional optimisation techniques. While these methods can give an optimal solution to small scale problems, they are often inefficient when applied to larger scale problems. The memetic algorithm presented here is essentially a genetic algorithm with an element of local search. The effectiveness of the method is tested through its application to real scale problems. |
Year | Venue | Keywords |
|---|---|---|
1997 | PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2 | memetic algorithm,scheduling problem,genetic algorithm,local search |
Field | DocType | Citations |
Memetic algorithm,Mathematical optimization,Job shop scheduling,Computer science,Local search (optimization),Genetic algorithm | Conference | 6 |
PageRank | References | Authors |
0.88 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edmund K. Burke | 1 | 5593 | 363.80 |
| Alistair J. Smith | 2 | 13 | 1.89 |