Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers
From MaRDI portal
Publication:5057997
DOI10.1287/ijoc.2022.1193zbMath1502.90074arXiv2012.09511OpenAlexW4224277325MaRDI QIDQ5057997
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.09511
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Uses Software
Cites Work
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- Towards a heterogeneous and adaptive parallel branch-and-bound algorithm
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Branch-and-bound and parallel computation: A historical note
- Parallel depth first search. I: Implementation
- An adaptive branching rule for the permutation flow-shop problem
- A fast tabu search algorithm for the permutation flow-shop problem
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Parallel hybrid heuristics for the permutation flow shop problem
- Solving large quadratic assignment problems on computational grids
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- Iterative beam search algorithms for the permutation flowshop
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Parallel Search Algorithms for Discrete Optimization Problems
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
This page was built for publication: Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers
