A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times (Q5449463)
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 5247433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times |
scientific article; zbMATH DE number 5247433 |
Statements
11 March 2008
0 references
tabu search
0 references
scheduling
0 references
unrelated parallel machines
0 references
setup times
0 references
0.8243811130523682
0 references
0.8230697512626648
0 references
0.8208957314491272
0 references
0.8194111585617065
0 references
0.8133941292762756
0 references
