New characterizations for the identical coupled tasks scheduling problem (Q6041202)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New characterizations for the identical coupled tasks scheduling problem |
scientific article; zbMATH DE number 7689323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New characterizations for the identical coupled tasks scheduling problem |
scientific article; zbMATH DE number 7689323 |
Statements
New characterizations for the identical coupled tasks scheduling problem (English)
0 references
26 May 2023
0 references
identical coupled tasks
0 references
lower bound
0 references
scheduling
0 references
0.8052671551704407
0 references
0.800565242767334
0 references
0.7980414032936096
0 references
0.796090841293335
0 references
0.7894266843795776
0 references
