Upper bound of the duration of the shortest schedule in one class of Hu problems (Q3902465): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal Sequencing of Two Equivalent Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-complete scheduling problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4076764 / rank | |||
Normal rank | |||
Latest revision as of 11:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound of the duration of the shortest schedule in one class of Hu problems |
scientific article |
Statements
Upper bound of the duration of the shortest schedule in one class of Hu problems (English)
0 references
1979
0 references
scheduling
0 references
