Production scheduling problems are typically combinational optimization problems named
bases on the processing routes of jobs on different machines. In this paper, the flexible job …

We propose several new hybrid heuristics for the differential dispersion problem, the best of
which consists of a GRASP with sampled greedy construction with variable neighborhood …

Diversity and dispersion problems deal with selecting a subset of elements from a given set
in such a way that their diversity is maximized. This study considers a practical location …

Abstract Graph Layout Problems refer to a family of optimization problems where the aim is
to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a …

This paper considers the vehicle routing problem with multiple time windows. It introduces a
general framework for three evolutionary heuristics that use three global multi-start …

Warehousing is a key part of supply chain management. It primarily focuses on controlling
the movement and storage of materials within a warehouse and processing the associated …

The multi-objective open vehicle routing problem (MO-OVRP) is a variant of the classic
vehicle routing problem in which routes are not required to return to the depot after …

This paper considers the minimal earliness tardiness-machine permutation flow shop
scheduling problem with distinct due dates and no inserted idle time when a job is waiting. It …

This paper presents a competitive algorithm that combines the Greedy Randomized
Adaptive Search Procedure including a Tabu Search instead of a traditional Local Search …

Energy demand prediction is an important problem whose solution is evaluated by policy
makers in order to take key decisions affecting the economy of a country. A number of …