Minimizing completion time for a class of scheduling problems (Q794156): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90124-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008585813 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4200070 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A labeling algorithm to recognize a line digraph and output its root graph / rank | |||
Normal rank | |||
Latest revision as of 12:58, 14 June 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
