Approximation algorithms and a hardness result for the three-machine proportionate mixed shop (Q6073050)
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 7750464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms and a hardness result for the three-machine proportionate mixed shop |
scientific article; zbMATH DE number 7750464 |
Statements
Approximation algorithms and a hardness result for the three-machine proportionate mixed shop (English)
0 references
16 October 2023
0 references
scheduling
0 references
mixed shop
0 references
approximation algorithm
0 references
fully polynomial-time approximation scheme
0 references
0.9704458713531494
0 references
0.944352090358734
0 references
0.890832245349884
0 references
0.8183166980743408
0 references
0.8074305057525635
0 references
