Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629)
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: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time |
scientific article; zbMATH DE number 6485257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time |
scientific article; zbMATH DE number 6485257 |
Statements
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (English)
0 references
24 September 2015
0 references
scheduling
0 references
machine maintenance
0 references
approximation algorithm
0 references
worst-case analysis
0 references
0 references
0 references
0 references
0 references
0.9617534875869752
0 references
0.9012438058853148
0 references
0.8503151535987854
0 references
0.8358836770057678
0 references
