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

Authors:
Guanlong Deng;Xingsheng Gu
Affiliations:
Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China;Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China
Venue:
Computers and Operations Research
Year:
2012

Citing 11
Cited 2

Flowshop with no idle machine time allowed

Computers and Industrial Engineering
Genetic algorithms applied to the continuous flow shop problem

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
Some local search algorithms for no-wait flow-shop problem with makespan criterion

Computers and Operations Research
An improved NEH heuristic to minimize makespan in permutation flow shops

Computers and Operations Research
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

Computers and Operations Research
A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Computers and Industrial Engineering
A DE-based approach to no-wait flow-shop scheduling

Computers and Industrial Engineering
A heuristic for minimizing the makespan in no-idle permutation flow shops

Computers and Industrial Engineering

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

SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a hybrid discrete differential evolution (HDDE) algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion, which is not so well studied. The no-idle condition requires that each machine must process jobs without any interruption from the start of processing the first job to the completion of processing the last job. A novel speed-up method based on network representation is proposed to evaluate the whole insert neighborhood of a job permutation and employed in HDDE, and moreover, an insert neighborhood local search is modified effectively in HDDE to balance global exploration and local exploitation. Experimental results and a thorough statistical analysis show that HDDE is superior to the existing state-of-the-art algorithms by a significant margin.