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
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
