Algorithms for solving hard optimization problems typically have several parameters that
need to be set appropriately such that some aspect of performance is optimized. In this …

In this work, a review and comprehensive evaluation of heuristics and metaheuristics for the
m-machine flowshop scheduling problem with the objective of minimising total tardiness is …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Metaheuristics are a relatively new but already established approach to combinatorial
optimization. A metaheuristic is a generic algorithmic template that can be used for finding …

The well-known NEH heuristic from Nawaz, Enscore and Ham proposed in 1983 has been
recognized as the highest performing method for the permutation flowshop scheduling …

The design and development of metaheuristic algorithms can be time-consuming and
difficult for a number of reasons including the complexity of the problems being tackled, the …

In this work three genetic algorithms are presented for the permutation flowshop scheduling
problem with total tardiness minimisation criterion. The algorithms include advanced …

The university course timetabling problem is an optimisation problem in which a set of
events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of …

Grou** problems aim to partition a set of items into multiple mutually disjoint subsets
according to some specific criterion and constraints. Grou** problems cover a large class …

Optimisation algorithms with good anytime behaviour try to return as high-quality solutions
as possible independently of the computation time allowed. Designing algorithms with good …