Minimizing completion time for a class of scheduling problems (Q794156)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3858400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing completion time for a class of scheduling problems |
scientific article; zbMATH DE number 3858400 |
Statements
Minimizing completion time for a class of scheduling problems (English)
0 references
1984
0 references
job scheduling
0 references
weighted linear scheduling problems
0 references
precedence constraints
0 references
greedy algorithm
0 references
setup minimization problem for N-free ordered sets
0 references
0.8054060339927673
0 references
0.7928693890571594
0 references
0.7860523462295532
0 references
0.7819321751594543
0 references
