Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105): Difference between revisions
From MaRDI portal
Latest revision as of 06:45, 2 July 2024
scientific article
| 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 |
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
