Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7116391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments |
scientific article; zbMATH DE number 7116391 |
Statements
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (English)
0 references
11 October 2019
0 references
makespan minimization
0 references
unrelated parallel machines
0 references
approximation algorithms
0 references
restricted assignment
0 references
bounded job assignments
0 references
job-intersection graphs
0 references
0.9890791773796082
0 references
0.8431824445724487
0 references
0.8388861417770386
0 references
0.8299213647842407
0 references
0.8218451142311096
0 references
