Approximation algorithms for the three-stage flexible flow shop problem with mid group constraint

作者：

Highlights：

• We propose ten heuristics for that problem and give their time complexities.

• We give 4 lower bounds for that problem and worst case rates of nine heuristics.

• We design a computational experiment to test the performance of ten heuristics.

• SP.JH-MJ is best and TSM is the worst among the ten heuristics by the experiment.

摘要

•We propose ten heuristics for that problem and give their time complexities.•We give 4 lower bounds for that problem and worst case rates of nine heuristics.•We design a computational experiment to test the performance of ten heuristics.•SP.JH-MJ is best and TSM is the worst among the ten heuristics by the experiment.

论文关键词：Heuristics,Flexible flow shop,Mid group constraint,Worst-case analysis

论文评审过程：Available online 24 December 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.12.024