Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions
proposed are of hybrid construction cutting across the traditional disciplines. The problem …

In the past, the notion of fitness landscapes has found widespread adoption. Many different
methods have been developed that provide a general and abstract framework applicable to …

ABSTRACT A great deal of research has been focused on solving the job-shop problem
(ΠJ), over the last forty years, resulting in a wide variety of approaches. Recently, much effort …

Tabu search algorithms are among the most effective approaches for solving the job-shop
scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so …

Despite their empirical effectiveness, our theoretical understanding of metaheuristic
algorithms based on local search (and all other paradigms) is very limited, leading to …

Hyper-heuristics or “methodologies to choose heuristics” are becoming increasingly popular
given their suitability to solve hard real world combinatorial optimisation problems. Their …

Over the last decade and a half, tabu search algorithms for machine scheduling have gained
a near-mythical reputation by consistently equaling or establishing state-of-the-art …

Many optimization problems (from academia or industry) require the use of a metaheuristic
to find a satisfying solution in a reasonable amount of time, even if optimality is not …

Vehicle routing problem (VRP) is a highly investigated discrete optimization problem. The
first paper was published in 1959, and later, many vehicle routing problem variants …

This paper discusses a multi-period and tri-objective portfolio optimization problem, where
asset returns are formalized as uncertain variables. Based on uncertainty theory, a multi …