Minimizing total completion time with machine-dependent priority lists (Q6586213)
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 completion time with machine-dependent priority lists |
scientific article; zbMATH DE number 7895424
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time with machine-dependent priority lists |
scientific article; zbMATH DE number 7895424 |
Statements
Minimizing total completion time with machine-dependent priority lists (English)
0 references
13 August 2024
0 references
scheduling
0 references
total completion time
0 references
priorities
0 references
dynamic programming
0 references
inapproximability
0 references
0 references
