A more effective constructive algorithm for permutation flowshop problem

Authors:
Xingye Dong;Houkuan Huang;Ping Chen
Affiliations:
School of Computer and IT, Beijing Jiaotong University, Beijing, China;School of Computer and IT, Beijing Jiaotong University, Beijing, China;School of Computer and IT, Beijing Jiaotong University, Beijing, China
Venue:
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Year:
2006

Citing 3
Cited 0

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
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

NEH (Nawaz et al., 1983) is an effective heuristic for solving the permutation flowshop problem with the objective of makespan. It includes two phases. PE-VM (Li et al., 2004), which is based on NEH, is analyzed and we conclude that its good performance is partially due to the priority rule it used in phase I. Then, we propose a new measure to solve job insertion ties which may arise in phase II. The measure is based on the idea of balancing the utilization among all machines. Finally, we propose a heuristic NEH-D (NEH based on Deviation), which combines the priority rule of PE-VM and the new measure. Computational results show that the measure is effective and NEH-D is better than PE-VM. There is one parameter in NEH-D, and we design an experiment to try to find a near optimized value of it for tuning the performance of NEH-D.