An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471)
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: An approximate algorithm for a high-multiplicity parallel machine scheduling problem |
scientific article; zbMATH DE number 5780109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate algorithm for a high-multiplicity parallel machine scheduling problem |
scientific article; zbMATH DE number 5780109 |
Statements
An approximate algorithm for a high-multiplicity parallel machine scheduling problem (English)
0 references
7 September 2010
0 references
scheduling
0 references
parallel machines
0 references
high multiplicity
0 references
approximation
0 references
0 references
0 references
0.8814540505409241
0 references
0.8418766260147095
0 references
0.8409221768379211
0 references
0.813133180141449
0 references
