The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1339913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines |
scientific article; zbMATH DE number 1339913 |
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
0.8907849788665771
0 references
0.8723143935203552
0 references
0.8713846802711487
0 references
0.8612934350967407
0 references
0.8582375049591064
0 references
