Pages that link to "Item:Q5057997"
From MaRDI portal
The following pages link to Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997):
Displaying 3 items.
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)