A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256)
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: A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem |
scientific article; zbMATH DE number 6579575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem |
scientific article; zbMATH DE number 6579575 |
Statements
A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (English)
0 references
12 May 2016
0 references
scheduling
0 references
two uniform parallel machines
0 references
LPT schedule
0 references
heuristic
0 references
0 references
0.8592586517333984
0 references
0.8464354276657104
0 references
0.8464354276657104
0 references
0.8357446789741516
0 references
0.8329912424087524
0 references
