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 the normal view instead:
scientific article; zbMATH DE number 6912893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexities of four problems on two-agent scheduling |
scientific article; zbMATH DE number 6912893 |
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
0.8847440481185913
0 references
0.8382124900817871
0 references
0.8323715329170227
0 references
0.8291234970092773
0 references
