Search
Now showing items 31-40 of 103
A local-best harmony search algorithm with dynamic subpopulations
(Engineering Optimization, 2010)
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 ...
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
(Applied Mathematics and Computation, 2010)
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) ...
Minimizing the total flow time in a flow shop with blocking by using hybridm harmony search algorithms
(Expert Systems with Applications, 2010)
In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, ...
An energy-efficient permutation flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2020)
The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production ...
An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2020)
This paper deals with a new automatic guided vehicle (AGV) scheduling problem from the material handling process in a linear manufacturing workshop. The problem is to determine a sequence of Cells for AGV to travel to ...
Metaheuristic algorithms for the hybrid flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2019)
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan ...
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
(MDPI, 2019)
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times
(SPRINGER INTERNATIONAL PUBLISHING AG, 2018)
Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling ...
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time
(SPRINGER INTERNATIONAL PUBLISHING AG, 2018)
Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency ...
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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
