The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel machines scheduling with nonsimultaneous machine available time / rank | |||
Normal rank | |||
Revision as of 21:46, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines |
scientific article |
Statements
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (English)
0 references
7 February 2000
0 references
nonsimultaneous multiprocessor scheduling problem
0 references
