In this work a new benchmark of hard instances for the permutation flowshop scheduling
problem with the objective of minimising the makespan is proposed. The new benchmark …

In consideration of the uncertainty of manufacturing system, this paper investigates a
distributed fuzzy blocking flow-shop scheduling problem (DFBFSP) in which there are …

This paper presents a general-purpose software framework dedicated to the design, the
analysis and the implementation of local search metaheuristics: ParadisEO-MO. A …

As a subcategory of the classical flow shop scheduling problem, the ordered flow shop
scheduling problem deals with the case where processing times follow a specific structure …

Solving efficiently complex problems using metaheuristics, and in particular local search
algorithms, requires incorporating knowledge about the problem to solve. In this paper, the …

Interactive reoptimization is an approach for progressively adjusting a candidate solution in
order to introduce aspects of a problem that have not been entirely captured by the …

After several decades of academic research in the field of automated nurse rostering, few
results find their way to practice. Often, the configuration of a software system for automated …

A number of local search based algorithms have been designed to escape from the local
optima, such as, iterated local search or variable neighborhood search. The neighborhood …

The HP model for protein structure prediction abstracts the fact that hydrophobicity is a
dominant force in the protein folding process. This challenging combinatorial optimization …

Solving combinatorial optimization problems efficiently requires the development of
algorithms that consider the specific properties of the problems. In this sense, local search …