An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763)
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: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints |
scientific article; zbMATH DE number 2117415
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints |
scientific article; zbMATH DE number 2117415 |
Statements
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (English)
0 references
22 November 2004
0 references
Single machine scheduling
0 references
Total completion time
0 references
Availability constraints
0 references
Approximation algorithm
0 references
Worst case analysis
0 references
0.9260295
0 references
0.9236666
0 references
0.90777075
0 references
0.90659505
0 references
0.9038342
0 references
0.9004426
0 references
