Complexities of four problems on two-agent scheduling (Q1653276): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-017-1141-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-017-1141-X / rank | |||
Normal rank | |||
Latest revision as of 01:11, 11 December 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
0 references
