This paper reviews the literature related to the class of scheduling problems that involve
sequence-dependent setup times (costs), an important consideration in many practical …

The first comprehensive survey paper on scheduling problems with separate setup times or
costs was conducted by [Allahverdi, A., Gupta, JND, Aldowaisan, T., 1999. A review of …

Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …

The generic denomination of 'Memetic Algorithms'(MAs) is used to encompass a broad class
of metaheuristics (ie, general purpose methods aimed to guide an underlying heuristic). The …

This chapter reviews applications of Memetic Algorithms in the areas of business analytics
and data science. This approach originates from the need to address optimization problems …

This paper proposes a hybrid metaheuristic for the minimization of makespan in scheduling
problems with parallel machines and sequence-dependent setup times. The solution …

Grou** problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …

This paper considers the problem of scheduling part families and jobs within each part
family in a flowshop manufacturing cell with sequence dependent family setups times where …

We model and solve the problem of sequencing a set of jobs with specified processing times
and tool requirements on a set of identical parallel machines. Decisions concern the …

This paper introduces a new memetic algorithm specialized for the asymmetric instances of
the traveling salesman problem (ATSP). The method incorporates a new local search …