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 this page instead for the normal view: Minimizing completion time for a class of scheduling problems |
scientific article; zbMATH DE number 3858400
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
