Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight bounds for the identical parallel machine‐scheduling problem: Part II |
scientific article; zbMATH DE number 5278194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for the identical parallel machine‐scheduling problem: Part II |
scientific article; zbMATH DE number 5278194 |
Statements
Tight bounds for the identical parallel machine‐scheduling problem: Part II (English)
0 references
22 May 2008
0 references
lower bounds
0 references
0 references
0 references
0.926089346408844
0 references
0.8434919714927673
0 references
0.8291376829147339
0 references
0.8274562954902649
0 references
0.8270818591117859
0 references
