The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q127883981, #quickstatements; #temporary_batch_1722343634948 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: 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 | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127883981 / rank | |||
Normal rank | |||
Latest revision as of 13:49, 30 July 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
