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 this page instead for the normal view: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs |
scientific article |
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
