Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840)
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 5199561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominance-based heuristics for one-machine total cost scheduling problems |
scientific article; zbMATH DE number 5199561 |
Statements
Dominance-based heuristics for one-machine total cost scheduling problems (English)
0 references
10 October 2007
0 references
Scheduling
0 references
heuristics
0 references
single machine
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8380998373031616
0 references
0.8379411101341248
0 references
0.8372925519943237
0 references
0.8329017162322998
0 references
0.8002979159355164
0 references
