Minimizing completion time for a class of scheduling problems (Q794156): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing completion time for a class of scheduling problems |
scientific article |
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
