Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532)
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: Experimental comparison of approximation algorithms for scheduling unrelated parallel machines |
scientific article; zbMATH DE number 6039080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Experimental comparison of approximation algorithms for scheduling unrelated parallel machines |
scientific article; zbMATH DE number 6039080 |
Statements
30 May 2012
0 references
production-scheduling
0 references
multiple machines
0 references
linear programming
0 references
Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (English)
0 references
0.8674013614654541
0 references
0.8576208353042603
0 references
0.8474144339561462
0 references
0.8368264436721802
0 references
0.835814893245697
0 references
