An improved NEH-based heuristic for the permutation flowshop problem

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

Citing 1
Cited 6

A heuristic algorithm for mean flowtime objective in flowshop scheduling

Computers and Operations Research

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

Computers and Operations Research
The distributed permutation flowshop scheduling problem

Computers and Operations Research
Study on heuristics for the permutation flowshop with sequence dependent setup times

IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Comparing three-step heuristics for the permutation flow shop problem

Computers and Operations Research
A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem

Applied Soft Computing
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

NEH is an effective heuristic for solving the permutation flowshop problem with the objective of makespan. It includes two phases: generate an initial sequence and then construct a solution. The initial sequence is studied and a strategy is proposed to solve job insertion ties which may arise in the construct process. The initial sequence which is generated by combining the average processing time of jobs and their standard deviations shows better performance. The proposed strategy is based on the idea of balancing the utilization among all machines. Experiments show that using this strategy can improve the performance of NEH significantly. Based on the above ideas, a heuristic NEH-D (NEH based on Deviation) is proposed, whose time complexity is O(mn^2), the same as that of NEH. Computational results on benchmarks show that the NEH-D is significantly better than the original NEH.