Bounds and tabu search for a cyclic max-min scheduling problem (Q1850964)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds and tabu search for a cyclic max-min scheduling problem |
scientific article; zbMATH DE number 1845377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds and tabu search for a cyclic max-min scheduling problem |
scientific article; zbMATH DE number 1845377 |
Statements
Bounds and tabu search for a cyclic max-min scheduling problem (English)
0 references
15 December 2002
0 references
scheduling
0 references
bottleneck problem
0 references
bounds
0 references
heuristics
0 references
tabu search
0 references
0.8291555047035217
0 references
0.7768279910087585
0 references
0.7686193585395813
0 references
