Study on heuristics for the permutation flowshop with sequence dependent setup times

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:
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Year:
2009

Citing 3
Cited 0

An Enhanced TSP-Based Heuristic for Makespan Minimizationin a Flow Shop with Setup Times

Journal of Heuristics
An improved NEH-based heuristic for the permutation flowshop problem

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

Scheduling: Theory, Algorithms, and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is studied that several constructive heuristics for solving the sequence dependent setup time flowshop problem with the objective of minimizing makespan. Three priority rules imbedded in the heuristics are tested and a tie-breaking strategy is examined. The experimental results on benchmarks show that the priority rules are helpful to improve the performance, especially for the instances in which setup times are averagely smaller than the average processing time. The results also show that the setup times have a large effect on the performance of the heuristics.