Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595)
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 algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval |
scientific article; zbMATH DE number 5604799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval |
scientific article; zbMATH DE number 5604799 |
Statements
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (English)
0 references
18 September 2009
0 references
scheduling
0 references
non-availability constraint
0 references
approximation
0 references
makespan
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8481788635253906
0 references
0.833621084690094
0 references
0.8278977870941162
0 references
0.8274888396263123
0 references
0.8250593543052673
0 references
