## Search

Now showing items 31-40 of 54

#### An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

(TAYLOR & FRANCIS LTD, 2015)

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) ...

#### 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 ...

#### 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 ...

#### Metaheuristic Algorithms for the Quadratic Assignment Problem

(IEEE, 2013)

This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, hich are destruction and construction procedures. The algorithm starts ...

#### A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem

(SPRINGER-VERLAG BERLIN, 2013)

In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...

#### A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops

(SPRINGER-VERLAG BERLIN, 2012)

In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...

#### Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm

(SPRINGER-VERLAG BERLIN, 2012)

This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...

#### 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 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 ...