The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling (Q1592285): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Evolution based learning in a job shop scheduling environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank | |||
Normal rank | |||
Revision as of 11:18, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling |
scientific article |
Statements
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling (English)
0 references
5 December 2001
0 references
warehouse scheduling
0 references
approximate evaluation
0 references
heuristics
0 references
genetic algorithms
0 references
local search
0 references
