A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704)
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: A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay |
scientific article; zbMATH DE number 7461109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay |
scientific article; zbMATH DE number 7461109 |
Statements
A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (English)
0 references
21 January 2022
0 references
scheduling theory
0 references
one device
0 references
total delay minimization
0 references
greedy algorithm
0 references
0.9045789
0 references
0.9045789
0 references
0.90006435
0 references
0.8783593
0 references
0.8783079
0 references
0.8756391
0 references
