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

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 sequence and re-inserted into all possible positions of the remaining seque...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2013-07, Vol.40 (7), p.1729-1743
Main Authors: Fatih Tasgetiren, M., Pan, Quan-Ke, Suganthan, P.N., Buyukdagli, Ozge
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Destruction
Differential evolution algorithm
Evolution
Exact sciences and technology
Genetic algorithms
Greedy algorithms
Heuristic optimization
Inventory control, production control. Distribution
Iterated greedy algorithm
Iterative methods
Job shops
Mathematical analysis
Mathematical problems
No-idle permutation flowshop scheduling problem
Operational research and scientific management
Operational research. Management science
Operations research
Permutations
Production scheduling
Scheduling
Scheduling, sequencing
Studies
Theoretical computing
Vectors (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!