Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date |
scientific article |
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
