## Search

Now showing items 1-20 of 103

#### An energy-efficient single machine scheduling with release dates and sequence-dependent setup times

(GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion, 2018)

This study considers single machine scheduling with the machine operating at varying speed levels for different jobs with release dates and sequence-dependent setup times, in order to examine the trade-off between makespan ...

#### Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization

(GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference, 2018)

1 The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and real-life applicability. Various exact and heuristic algorithms have been developed for the HFSP, ...

#### Variable block insertion heuristic for the quadratic assignment problem

(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)

The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...

#### A variable block insertion heuristic for permutation flowshops with makespan criterion

(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)

This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...

#### Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

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

#### A multi-objective self-adaptive differential evolution algorithm for conceptual high-rise building design

(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)

This paper presents a multi-objective self-adaptive differential evolution algorithm to solve the form-finding problem of high-rise building design in the conceptual phase. The aim of the research is to reach suitable ...

#### A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times

(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)

A discrete artificial bee colony (DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ...

#### Multi-objective harmony search algorithm for layout design in theatre hall acoustics

(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)

The aim of the research is to find a feasible set of theatre hall design alternatives for two objectives, which are the total cost and the reverberation time, subject to several constraints. We formulate the problem as a ...

#### An ensemble of differential evolution algorithms with variable neighborhood search for constrained function optimization

(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)

In this paper, an ensemble of differential evolution algorithms based on a variable neighborhood search algorithm (EDE-VNS) is proposed so as to solve the constrained real parameter-optimization problems. The performance ...

#### Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion

(Knowledge-Based Systems, 2016)

This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...

#### A populated local search with differential evolution for blocking flowshop scheduling problem

(2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)

This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search ...

#### A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem

(2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)

This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ...

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

(International Journal of Production Research, 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) ...

#### An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion

(IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CIPLS 2014: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, Proceedings, 2014)

The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ...

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

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

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

#### 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 variable iterated greedy algorithm with differential evolution for solving no-idle flowshops

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