Complexities of four problems on two-agent scheduling (Q1653276): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:22, 1 February 2024
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
