Name
Abstract | ||
|---|---|---|
The choice of search algorithm can play a vital role in the success of a schedulingapplication. In this paper, we investigate the contribution of search algorithms insolving a real-world warehouse scheduling problem. We compare performance ofthree types of scheduling algorithms: heuristic, genetic algorithms and local search. |
Year | Venue | Keywords |
|---|---|---|
1996 | AIPS | local search,scheduling algorithm,scheduling problem,genetic algorithm,search algorithm |
Field | DocType | Citations |
Mathematical optimization,Incremental heuristic search,Search algorithm,Guided Local Search,Fair-share scheduling,Computer science,Beam search,Artificial intelligence,Local search (optimization),Dynamic priority scheduling,Machine learning,Best-first search | Conference | 7 |
PageRank | References | Authors |
0.91 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soraya B. Rana | 1 | 253 | 34.60 |
| Adele E. Howe | 2 | 561 | 65.70 |
| L. Darrell Whitley | 3 | 6631 | 968.30 |
| Keith E. Mathias | 4 | 1070 | 197.79 |