## Search

Now showing items 1-10 of 10

#### A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem

(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 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 ...

#### Lagrangian heuristic for scheduling a steelmaking-continuous casting process

(Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Scheduling, CISched 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)

One of the biggest bottlenecks in iron and steel production is the steelmaking-continuous casting (SCC) process, which consists of steel-making, refining and continuous casting. The production scheduling of SCC is a complex ...

#### Metaheuristic algorithms for the quadratic assignment problem

(Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, CIPLS 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)

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

#### A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

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

(Applied Mathematical Modelling, 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 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 ...

#### Lagrangian heuristic for scheduling a steelmaking-continuous casting process

(IEEE, 2013)

One of the biggest bottlenecks in iron and steel production is the steelmaking-continuous casting (SCC) process, which consists of steel-making, re ning and continuous casting. The production scheduling of SCC is a complex ...

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