A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion (Q5876237)
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: A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion |
scientific article; zbMATH DE number 7647890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion |
scientific article; zbMATH DE number 7647890 |
Statements
31 January 2023
0 references
scheduling
0 references
approximation algorithm
0 references
list scheduling algorithm
0 references
non-renewable resource
0 references
0.9357149600982666
0 references
0.8910214900970459
0 references
0.8812642693519592
0 references
0.8730939030647278
0 references
0.8393853902816772
0 references
