Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301)
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: Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs |
scientific article; zbMATH DE number 7354576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs |
scientific article; zbMATH DE number 7354576 |
Statements
Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (English)
0 references
3 June 2021
0 references
two-agent scheduling
0 references
completion time
0 references
tardy job
0 references
NP-completeness
0 references
FPTAS
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
