On the complexity of coupled-task scheduling (Q5961610)
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 981907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of coupled-task scheduling |
scientific article; zbMATH DE number 981907 |
Statements
On the complexity of coupled-task scheduling (English)
0 references
25 February 1997
0 references
coupled-task
0 references
sequencing
0 references
single machine
0 references
makespan
0 references
NP-hardness
0 references
polynomial algorithms
0 references
0.802573025226593
0 references
0.8021083474159241
0 references
0.7977582812309265
0 references
0.7936855554580688
0 references
0.7892043590545654
0 references
