Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (Q4632917)
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: Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work |
scientific article; zbMATH DE number 7049627
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work |
scientific article; zbMATH DE number 7049627 |
Statements
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (English)
0 references
2 May 2019
0 references
scheduling
0 references
late work
0 references
fully polynomial-time approximation scheme
0 references
