4.2 Article

An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server

Journal

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
Volume 5, Issue 2, Pages 111-131

Publisher

INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2011.039869

Keywords

two machine flow shop; no-wait; separable setup; makespan; single server

Ask authors/readers for more resources

We consider the two-machine no-wait flow shop problem with separable setup times and single server side constraints, and makespan as the performance measure. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special cases. Furthermore, a hybrid algorithm of variable neighbourhood search (VNS) and Tabu search (TS) is proposed for the generic case. For evaluation, a number of test problems with small instances are generated and solved to optimality. Computational results show that the proposed algorithm is able to reproduce the optimal solutions of all of the small-instance test problems. For larger instances, proposed solutions are compared with the results of the famous two-opt algorithm as well as a lower bound that we develop in this paper. This comparison demonstrates the efficiency of the algorithm to find good-quality solutions.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available