Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date |
scientific article; zbMATH DE number 7173700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date |
scientific article; zbMATH DE number 7173700 |
Statements
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (English)
0 references
25 February 2020
0 references
scheduling
0 references
parallel identical machines
0 references
early work
0 references
late work
0 references
fully polynomial time approximation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9097256064414978
0 references
0.8638847470283508
0 references
0.8564859628677368
0 references
0.8190008997917175
0 references
