Scheduling with non-renewable resources: minimizing the sum of completion times (Q6547136)
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: Scheduling with non-renewable resources: minimizing the sum of completion times |
scientific article; zbMATH DE number 7856507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling with non-renewable resources: minimizing the sum of completion times |
scientific article; zbMATH DE number 7856507 |
Statements
Scheduling with non-renewable resources: minimizing the sum of completion times (English)
0 references
30 May 2024
0 references
approximation algorithm
0 references
non-renewable resources
0 references
polynomial-time approximation scheme
0 references
strong NP-hardness
0 references
scheduling
0 references
weighted sum of completion times
0 references
0 references
0 references
0 references
0 references
0 references
