A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (Q5943566)
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 1652367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times |
scientific article; zbMATH DE number 1652367 |
Statements
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (English)
0 references
27 September 2001
0 references
machine scheduling
0 references
lower bounds
0 references
heuristics
0 references
0.7900501489639282
0 references
0.7872570753097534
0 references
0.7807545065879822
0 references
0.779279887676239
0 references
