New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (Q2078845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7483886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints |
scientific article; zbMATH DE number 7483886 |
Statements
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (English)
0 references
4 March 2022
0 references
single machine scheduling
0 references
non-renewable resources
0 references
approximation algorithms
0 references
FPTAS
0 references
high-multiplicity scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0.957537055015564
0 references
0.8923740386962891
0 references
0.8730939030647278
0 references
0.8729538917541504
0 references
0.8660330176353455
0 references
