The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435)
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 7155042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs |
scientific article; zbMATH DE number 7155042 |
Statements
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (English)
0 references
22 January 2020
0 references
two-agent scheduling
0 references
total completion time
0 references
total number of tardy jobs
0 references
0 references
0.8618997931480408
0 references
0.8391997814178467
0 references
0.8382124900817871
0 references
0.8205599784851074
0 references
