Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5169658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint |
scientific article; zbMATH DE number 5169658 |
Statements
Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (English)
0 references
4 July 2007
0 references
approximation algorithms
0 references
0.9260295
0 references
0.9136435
0 references
0.9067369
0 references
0.90377057
0 references
0.8975242
0 references
0.89271915
0 references
0.8927105
0 references
0.8909099
0 references
0.8847327
0 references
