Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time |
scientific article |
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
