Search
Now showing items 51-60 of 92
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
(ELSEVIER SCIENCE BV, 2016)
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 ...
A Multi-Objective Harmony Search Algorithm for Sustainable Design of Floating Settlements
(MDPI AG, 2016)
This paper is concerned with the application of computational intelligence techniques to the conceptual design and development of a large-scale floating settlement. The settlement in question is a design for the area of ...
An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion
(IEEE, 2014)
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ...
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(ELSEVIER SCIENCE INC, 2013)
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 ...
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2013)
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 ...
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(PERGAMON-ELSEVIER SCIENCE LTD, 2017)
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 ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Multi-Objective Harmony Search Algorithm for Layout Design in Theatre Hall Acoustics
(IEEE, 2016)
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 ...
A Memetic Algorithm With A Variable Block Insertion Heuristic for Single Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times
(IEEE, 2016)
In this paper, a memetic algorithm with a variable block insertion heuristic is presented to solve the single machine total weighted tardiness problem with sequence dependent setup times. Together with the traditional ...
An Ensemble of Differential Evolution Algorithms with Variable Neighborhood Search for Constrained Function Optimization
(IEEE, 2016)
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 ...