Complexities of four problems on two-agent scheduling (Q1653276)
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: Complexities of four problems on two-agent scheduling |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexities of four problems on two-agent scheduling |
scientific article |
Statements
Complexities of four problems on two-agent scheduling (English)
0 references
3 August 2018
0 references
scheduling
0 references
two-agent
0 references
number of tardy jobs
0 references
NP-hard
0 references
pseudo-polynomial time
0 references
0 references
