Improved 0/1-interchange scheduling (Q1169295): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank |
Latest revision as of 16:53, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved 0/1-interchange scheduling |
scientific article |
Statements
Improved 0/1-interchange scheduling (English)
0 references
1982
0 references
22, 282-290 (1982)
0 references
multiprocessor scheduling
0 references
approximation algorithms
0 references
worst-case analysis
0 references
identical processors
0 references
worst-case performance
0 references