Tight approximation algorithms for scheduling with fixed jobs and nonavailability (Q3189068)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight approximation algorithms for scheduling with fixed jobs and nonavailability |
scientific article |
Statements
Tight approximation algorithms for scheduling with fixed jobs and nonavailability (English)
0 references
9 September 2014
0 references
approximation
0 references
optimization
0 references
scheduling
0 references
