On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718)
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: On minimizing the makespan when some jobs cannot be assigned on the same machine |
scientific article; zbMATH DE number 7205009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimizing the makespan when some jobs cannot be assigned on the same machine |
scientific article; zbMATH DE number 7205009 |
Statements
27 May 2020
0 references
approximation algorithms
0 references
scheduling
0 references
makespan minimization
0 references
On minimizing the makespan when some jobs cannot be assigned on the same machine (English)
0 references
0.90990907
0 references
0.90990907
0 references
0.90547127
0 references
0 references
0.9023385
0 references
0.8997537
0 references
0.89884615
0 references
0 references
