Running time of local search algorithms for a scheduling problem on the parallel machines (Q5263787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6460022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Running time of local search algorithms for a scheduling problem on the parallel machines |
scientific article; zbMATH DE number 6460022 |
Statements
17 July 2015
0 references
local search algorithm
0 references
neighborhood
0 references
running time of the algorithm
0 references
upper bound
0 references
lower bound
0 references
0.8247167468070984
0 references
0.8020355701446533
0 references
0.7966862916946411
0 references
