A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops

Authors:
M. Fatih Tasgetiren;Quan-Ke Pan;P. N. Suganthan;Ozge Buyukdagli
Affiliations:
Industrial Engineering Department, Yasar University, Izmir, Turkey;School of Computer Science, Liaocheng University, China;School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore;Industrial Engineering Department, Yasar University, Izmir, Turkey
Venue:
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Year:
2012

Citing 7
Cited 0

Flowshop with no idle machine time allowed

Computers and Industrial Engineering
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Three stage no-idle flow-shops

Computers and Industrial Engineering
More on three-machine no-idle flow shops

Computers and Industrial Engineering
Flowshop/No-idle Scheduling to Minimize Total Elapsed Time

Journal of Global Optimization
A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

Computers and Operations Research
Differential Evolution: A Survey of the State-of-the-Art

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the differential evolution algorithm. A unique multi-chromosome solution representation is presented in such a way that the first chromosome represents the destruction size and the probability whereas the second chromosome is simply a job permutation assigned to each individual in the population randomly. The proposed algorithm is applied to the no-idle permutation flowshop scheduling problem with the makespan criterion. The performance of the proposed algorithm is tested on the Ruben Ruiz's benchmark suite and compared to their best known solutions available in http://soa.iti.es/rruiz as well as to a very recent discrete differential evolution algorithm from the literature. The computational results show its highly competitive performance and ultimately, 183 out of 250 instances are further improved. In comparison to the very recent hybrid discrete differential evolution algorithm, 114 out of 150 new best known solutions they provided are also further improved.