Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211)
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 6290494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-dedicated-machine scheduling problem with precedence relations to minimize makespan |
scientific article; zbMATH DE number 6290494 |
Statements
Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (English)
0 references
30 April 2014
0 references
parallel machine scheduling
0 references
complexity
0 references
assembly line balancing
0 references
0 references
0.874201774597168
0 references
0.8478631973266602
0 references
0.833820641040802
0 references
0.8309952616691589
0 references
0.827751636505127
0 references
