A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (Q2059081): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10951-021-00681-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-021-00681-Y / rank | |||
Normal rank | |||
Latest revision as of 22:01, 16 December 2024
scientific article
| 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 |
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
