This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm ...

In this paper, an ensemble of discrete differential evolution algorithms with parallel populations is presented. In a single populated discrete differential evolution (DDE) algorithm, the destruction and construction (DC) ...

Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...

This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...

The aim of the research is to find a feasible set of theatre hall design alternatives for two objectives, which are the total cost and the reverberation time, subject to several constraints. We formulate the problem as a ...

In this paper, an ensemble of differential evolution algorithms based on a variable neighborhood search algorithm (EDE-VNS) is proposed so as to solve the constrained real parameter-optimization problems. The performance ...

This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job insertion includes two phases: initializing schedules and rescheduling after each new job insertion. ...

This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) ...

This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ...

In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ...