Search
Now showing items 81-90 of 103
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(ELSEVIER SCIENCE INC, 2011)
In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the ...
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(ELSEVIER SCIENCE INC, 2011)
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ...
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2011)
This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ...
Dynamic multi-swarm particle swarm optimizer with harmony search
(PERGAMON-ELSEVIER SCIENCE LTD, 2011)
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) is improved by hybridizing it with the harmony search (HS) algorithm and the resulting algorithm is abbreviated as DMS-PSO-HS. We present a novel ...
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2011)
In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow ...
Differential evolution algorithm with ensemble of parameters and mutation strategies
(ELSEVIER, 2011)
Differential evolution (DE) has attracted much attention recently as an effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of the mutation strategy and ...
A Differential Evolution Algorithm for the Median Cycle Problem
(IEEE, 2011)
This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ...
A green scheduling algorithm for the distributed flowshop problem
(Elsevier, 2021)
In recent years, sustainable development and green manufacturing have attracted widespread attention to environmental problems becoming increasingly serious. Meanwhile, affected by the intensification of market competition ...
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
(Elsevier, 2021-06)
Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints, which have important applications in practice. ...
Solving Lot-streaming Flow Shop Scheduling Problems Using a Discrete Harmony Search Algorithm
(IEEE, 2010)
The harmony search (HS) algorithm is one of the recent evolutionary computation techniques to solve optimization problems. To make it applicable for lot-streaming flow shop problems, a discrete variant of the HS algorithm ...