Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940)
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: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work |
scientific article; zbMATH DE number 6800890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work |
scientific article; zbMATH DE number 6800890 |
Statements
Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (English)
0 references
27 October 2017
0 references
scheduling
0 references
parallel machines
0 references
early work
0 references
late work
0 references
polynomial time approximation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
