Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DOGS-PFSP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4224277325 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2012.09511 / rank | |||
Normal rank | |||
Revision as of 23:00, 19 April 2024
scientific article; zbMATH DE number 7625886
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
