Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631)
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 6033980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks |
scientific article; zbMATH DE number 6033980 |
Statements
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (English)
0 references
13 May 2012
0 references
polynomial-time algorithm
0 references
scheduling
0 references
coupled-tasks
0 references
matching
0 references
0.90598905
0 references
0.90145403
0 references
0 references
0.89433634
0 references
0.8897754
0 references
0.88147056
0 references
0.8770116
0 references
