A full polynomial-time approximation scheme of two-agent scheduling with job rejection (Q3380864)
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 7403716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A full polynomial-time approximation scheme of two-agent scheduling with job rejection |
scientific article; zbMATH DE number 7403716 |
Statements
29 September 2021
0 references
scheduling
0 references
rejection
0 references
approximation scheme
0 references
0.9139991998672484
0 references
0.8879795074462891
0 references
0.8424657583236694
0 references
0.8413140177726746
0 references
0.8366878032684326
0 references
