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 …

This study focuses on the energy optimization of industrial robotic cells, which is essential for
sustainable production in the long term. A holistic approach that considers a robotic cell as a …

The efficient use of resources is a key factor to minimize the cost while meeting time
deadlines and quality requirements; this is especially important in construction projects …

Makespan minimization in permutation flow-shop scheduling is a well-known hard
combinatorial optimization problem. Among the 120 standard benchmark instances …

We investigate the design of parallel B&B in large scale heterogeneous compute
environments where processing units can be composed of a mixture of multiple shared …

Scheduling problems occur in a broad range of real-world application fields and have
attracted a huge set of research articles. However, there is only little research on exact …

In this paper, we describe the first parallel Branch-and-Bound (B&B) algorithm with a history-
based domination technique. Although history-based domination substantially speeds up a …

The workspace of a robot is the set of positions that can be taken by its working tool. The
understanding of the workspace is necessary when designing robots, planning their …

In this paper, we describe how to combine a parallel branch-and-bound (B&B) algorithm and
a strong heuristic to solve the Sequential Ordering Problem (SOP), which is an NP-hard …

Makespan minimization in permutation flow-shop scheduling is a well-known hard
combinatorial optimization problem. Among the 120 standard benchmark instances …