Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints (Q2294889)
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: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints |
scientific article; zbMATH DE number 7166357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints |
scientific article; zbMATH DE number 7166357 |
Statements
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints (English)
0 references
12 February 2020
0 references
single-machine scheduling
0 references
non-renewable resources
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0.957537055015564
0 references
0.900985062122345
0 references
0.8910214900970459
0 references
0.8844093084335327
0 references
0.8651112914085388
0 references
