A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval (Q4901463)
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 6129923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval |
scientific article; zbMATH DE number 6129923 |
Statements
24 January 2013
0 references
scheduling
0 references
non-availability interval
0 references
makespan
0 references
fully polynomial-time approximation scheme
0 references
0.8786232471466064
0 references
0.8753728270530701
0 references
0.8746667504310608
0 references
0.864423930644989
0 references
0.8577139377593994
0 references
