## Search

Now showing items 71-80 of 103

#### A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities

(ELSEVIER SCIENCE INC, 2014)

This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ...

#### An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop

(IEEE Access, 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

(Computers and Operations Research, 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

(Algorithms, 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 ...

#### A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem

(Procedia Manufacturing, 2019)

No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP), where the processing of each job must be continuous from start to end without any interruption. ...

#### A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem

(Procedia Manufacturing, 2019)

No-idle permutation flowshop scheduling problem (NIPFSP) is a well-known NP-hard problem, in which each machine must perform the jobs consecutively without any idle time. Even though various algorithms have been proposed ...

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

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