An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

Authors:
Xingye Dong;Houkuan Huang;Ping Chen
Affiliations:
School of Computer and Information Technology, Beijing Jiaotong University, 100044 Beijing, China;School of Computer and Information Technology, Beijing Jiaotong University, 100044 Beijing, China;School of Computer and Information Technology, Beijing Jiaotong University, 100044 Beijing, China
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 11

A heuristic algorithm for mean flowtime objective in flowshop scheduling

Computers and Operations Research
Comparison of heuristics for flowtime minimisation in permutation flowshops

Computers and Operations Research
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
A neural network to enhance local search in the permutation flowshop

Computers and Industrial Engineering
An improved NEH-based heuristic for the permutation flowshop problem

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

Computers and Industrial Engineering
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization

Computers and Industrial Engineering
Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform

Journal of Parallel and Distributed Computing
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences: an International Journal
A matheuristic approach for the total completion time two-machines permutation flow shop problem

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
New VNS heuristic for total flowtime flowshop scheduling problem

Expert Systems with Applications: An International Journal
Meta-heuristic algorithms for solving a fuzzy single-period problem

Mathematical and Computer Modelling: An International Journal
Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

Expert Systems with Applications: An International Journal
Invited Review: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

Computers and Operations Research
A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

Computers and Operations Research
An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

Advances in Engineering Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

An ILS algorithm is proposed to solve the permutation flowshop sequencing problem with total flowtime criterion. The effects of different initial permutations and different perturbation strengths are studied. Comparisons are carried out with three constructive heuristics, three ant-colony algorithms and a particle swarm optimization algorithm. Experiments on benchmarks and a set of random instances show that the proposed algorithm is more effective. The presented ILS improves the best known permutations by a significant margin.