A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (Q2059081)
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 tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource |
scientific article; zbMATH DE number 7443693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource |
scientific article; zbMATH DE number 7443693 |
Statements
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (English)
0 references
13 December 2021
0 references
single-machine scheduling problems
0 references
non-renewable resources
0 references
list scheduling algorithm
0 references
approximation algorithms
0 references
0 references
0 references
