A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
CP Tomazella, MS Nagano - Expert Systems with Applications, 2020 - Elsevier
This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …
Parallel computational optimization in operations research: A new integrative framework, literature review and research directions
G Schryen - European Journal of Operational Research, 2020 - Elsevier
Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …
relevance for solving hard optimization problems in many fields, including finance, logistics …
Traffic signal optimization on a square lattice with quantum annealing
The spread of intelligent transportation systems in urban cities has caused heavy
computational loads, requiring a novel architecture for managing large-scale traffic. In this …
computational loads, requiring a novel architecture for managing large-scale traffic. In this …
On unifying some cryptographic protocol logics
PF Syverson, PC Van Oorschot - Proceedings of 1994 IEEE …, 1994 - ieeexplore.ieee.org
We present a logic for analyzing cryptographic protocols. This logic encompasses a
unification of four of its predecessors in the BAN family of logics, namely those given by Li …
unification of four of its predecessors in the BAN family of logics, namely those given by Li …
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
In this work we propose an efficient branch-and-bound (B&B) algorithm for the permutation
flow-shop problem (PFSP) with makespan objective. We present a new node decomposition …
flow-shop problem (PFSP) with makespan objective. We present a new node decomposition …
An optimization case study for solving a transport robot scheduling problem on quantum-hybrid and quantum-inspired hardware
We present a comprehensive case study comparing the performance of D-Waves' quantum-
classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of …
classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of …
A survey on techniques for cooperative CPU-GPU computing
K Raju, NN Chiplunkar - Sustainable Computing: Informatics and Systems, 2018 - Elsevier
Abstract Graphical Processing Unit provides massive parallelism due to the presence of
hundreds of cores. Usage of GPUs for general purpose computation (GPGPU) has resulted …
hundreds of cores. Usage of GPUs for general purpose computation (GPGPU) has resulted …
Scaling exact multi-objective combinatorial optimization by parallelization
Multi-Objective Combinatorial Optimization (MOCO) is fundamental to the development and
optimization of software systems. We propose five novel parallel algorithms for solving …
optimization of software systems. We propose five novel parallel algorithms for solving …
Iterative beam search algorithms for the permutation flowshop
L Libralesso, PA Focke, A Secardin, V Jost - European Journal of …, 2022 - Elsevier
We study an iterative beam search algorithm for the permutation flowshop (makespan and
flowtime minimization). This algorithm combines branching strategies inspired by recent …
flowtime minimization). This algorithm combines branching strategies inspired by recent …
Exactly solving hard permutation flowshop scheduling problems on peta-scale gpu-accelerated supercomputers
J Gmys - INFORMS Journal on Computing, 2022 - pubsonline.informs.org
Makespan minimization in permutation flow-shop scheduling is a well-known hard
combinatorial optimization problem. Among the 120 standard benchmark instances …
combinatorial optimization problem. Among the 120 standard benchmark instances …