An effective heuristic for minimising makespan on unrelated parallel machines (Q3157751)
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: An effective heuristic for minimising makespan on unrelated parallel machines |
scientific article; zbMATH DE number 2130079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective heuristic for minimising makespan on unrelated parallel machines |
scientific article; zbMATH DE number 2130079 |
Statements
An effective heuristic for minimising makespan on unrelated parallel machines (English)
0 references
19 January 2005
0 references
scheduling
0 references
heuristics
0 references
tabu search
0 references
unrelated machines
0 references
0.8378154635429382
0 references
0.8194111585617065
0 references
0.814187228679657
0 references
0.811145007610321
0 references
