Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347)
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 7159805
| 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 7159805 |
Statements
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (English)
0 references
29 January 2020
0 references
unrelated parallel machine scheduling
0 references
approximation algorithms
0 references
restricted assignment
0 references
bounded job assignments
0 references
job-intersection graphs
0 references
bag constraints
0 references
0 references
0 references
0 references
0.9890791773796082
0 references
0.8699391484260559
0 references
0.862330973148346
0 references
0.8338621854782104
0 references
0.8301756381988525
0 references
