Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers (Q5057997)
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 7625886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers |
scientific article; zbMATH DE number 7625886 |
Statements
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (English)
0 references
1 December 2022
0 references
permutation flow-shop scheduling
0 references
branch-and-bound
0 references
supercomputing
0 references
GPU computing
0 references
0 references
0 references
0 references
0 references
0.8312066197395325
0 references
0.8119134306907654
0 references
0.8027364611625671
0 references
0.7803378105163574
0 references
