• Corpus ID: 229298133

Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers

  title={Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers},
  author={Jan Gmys},
  • Jan Gmys
  • Published 17 December 2020
  • Computer Science
  • ArXiv
Makespan minimization in permutation flow-shop scheduling is a well-known hard combinatorial optimization problem. Among the 120 standard benchmark instances proposed by E. Taillard in 1993, 23 have remained unsolved for almost three decades. In this paper, we present our attempts to solve these instances to optimality using parallel Branch-and-Bound tree search on the GPU-accelerated Jean Zay supercomputer. We report the exact solution of 11 previously unsolved problem instances and improved… 
1 Citations
Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time
  • J. Rudy
  • Computer Science
    Applied Sciences
  • 2021
The experiments on the Taillard-based problem instances using a simulated annealing solving method and employing the parallel makespan calculation show that the method is able to perform many more iterations in the given time limit and obtain better results than the non-parallel version.


Heterogeneous cluster computing for many-task exact optimization - Application to permutation problems. (Optimisation massivement multi-tâche sur grappes de calcul hétérogènes - Application aux problèmes de permutation)
Based on a compact encoding of the search space in the form of intervals, work stealing strategies for multi-core and GPU are proposed, as well as hierarchical approaches for load balancing in distributed memory multi-CPU/multi-GPU systems.
A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System
A multi-threaded factoradic-based branch-and-bound algorithm to solve permutation combinatorial problems on multi-core processors based on a matrix of integers instead of a pool of permutations and work units exchanged between threads are intervals of factoradics instead of sets of nodes.
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
This work presents a new node decomposition scheme that combines dynamic branching and lower bound refinement strategies in a computationally efficient way and demonstrates that parallel tree search is a key ingredient for the resolution of large problem instances, as strong super-linear speedups can be observed.
Combining multi-core and GPU computing for solving combinatorial optimization problems
The design and implementation of Branch-and-Bound (B&B) algorithms for solving large combinatorial optimization problems on GPU-enhanced multi-core machines are revisited and a GPU-accelerated approach in which only a single CPU core is used and only the bounding operator is performed on the GPU device is proposed.
A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems
This work presents a GPU-based backtracking algorithm for permutation combinatorial problems based on the Integer-Vector-Matrix (IVM) data structure, and implements this new algorithm for solving instances of the Asymmetric Travelling Salesman Problem by implicit enumeration.
Parallel depth first search. Part I. Implementation
A parallel formulation of depth-first search which retains the storage efficiency of sequential depth- first search and can be mapped on to anyMIMD architecture is presented and results show that hypercube and sharedmemory architectures are significantly better.
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
An adaptation of the parallel branch and bound algorithm for computational grids based on new ways to efficiently deal with some crucial issues, mainly dynamic adaptive load balancing, fault tolerance, global information sharing and termination detection of the algorithm is proposed.
Parallel hybrid heuristics for the permutation flow shop problem
This paper proposes and analyse parallel hybrid search methods that fully use the computational power of current multi-core machines and indicates that the use of the MA to manage a pool of solutions is highly effective, allowing the improvement of the best known upper bound for one of the instances.
A New Parallel Schema for Branch-and-Bound Algorithms Using GPGPU
This work presents a new parallel procedure designed to process combinatorial B&B algorithms using GPGPU. In our schema we dispatch a number of threads that treats intelligently the massively
Parallel Branch‐and‐Bound Algorithms
In the beginning of the twenty-first century, large unsolved combinatorial optimization problems have been solved exactly and the scientific progress in Operations Research, in particular regarding the quality of the lower bounds for these problems, brought on these achievements.