Two-stage hybrid flow shop scheduling with batch machines and jobs arriving over time is
complex and challenging in various real-world production scenarios. For the online …

Resource constrained project scheduling problem is an NP-hard problem that attracts many
researchers because of its complexity and daily use. In literature there are a lot of various …

Priority rules combined with schedule generation schemes are a usual approach to online
scheduling. These rules are commonly designed by experts on the problem domain …

Priority rules are one of the most common and popular approaches to real-time scheduling.
Over the last decades, several methods have been developed to generate rules …

The container relocation problem is a challenging combinatorial optimisation problem
tasked with finding a sequence of container relocations required to retrieve all containers by …

Abstract The Travelling Salesman Problem (TSP) is a well-known optimisation problem that
has been widely studied over the last century. As a result, a variety of exact and approximate …

Surrogate evaluation is a useful, if not the unique, technique in population-based
evolutionary algorithms where exact fitness calculation is too expensive. This situation …

In the process industries, where orders arrive at irregular intervals, inappropriate
maintenance frequency often leads to unplanned shutdowns of high-speed parallel …

Dynamic scheduling represents an important combinatorial optimisation problem that often
appears in the real world. The difficulty in solving these problems arises from their dynamic …

Automatically designing new dispatching rules (DRs) by genetic programming has become
an increasingly researched topic. Such an approach enables that DRs can be designed …