An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems

Omid Shahvari, Nasser Salmasi, Rasaratnam Logendran, Babak Abbasi

International Journal of Production Research · 2011 · 57 citations · 16 references

Concepts

Abstract

In this paper, the flexible flow shop sequence-dependent group scheduling problem (FFSDGS) with\nminimisation of makespan as the criterion (FFm | fmls, Splk |Cmax) is investigated. For the first time a\nmathematical model for the proposed research problem is developed. Since the problem is shown to be\nNP-hard, six metaheuristic algorithms based on tabu search (TS) are developed to efficiently solve the\nproblem.

References

16