Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105)
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: Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval |
scientific article; zbMATH DE number 5642852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval |
scientific article; zbMATH DE number 5642852 |
Statements
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (English)
0 references
7 December 2009
0 references
single machine scheduling
0 references
machine non-availability
0 references
total weighted completion time
0 references
approximation algorithm
0 references
0 references
0 references
0 references
