An efficient constructive heuristic for flowtime minimisation in permutation flow shops

An efficient constructive heuristic for flowtime minimisation in permutation flow shops

0.00 Avg rating0 Votes
Article ID: iaor20042623
Country: United Kingdom
Volume: 31
Issue: 4
Start Page Number: 311
End Page Number: 317
Publication Date: Aug 2003
Journal: OMEGA
Authors: ,
Keywords: production
Abstract:

In this paper, we propose a heuristic for mean/total flowtime minimisation in permutation flow shops. The heuristic exploits the idea of ‘optimising’ partial schedules, already present in the NEH-heuristic with respect to makespan minimisation. We compare the proposed heuristic against those of Rajendran and Ziegler, and Woo and Yim, which are considered the best constructive heuristics for flowtime minimisation so far. The computational experiments carried out show that our proposal outperforms both heuristics with respect to the quality of the solutions. Moreover, our heuristic can be embedded in an improvement scheme to build a composite heuristic in the manner suggested by Allahverdi and Aldowaisan for the flowtime minimisation problem. The so-constructed composite heuristic also improves the best results obtained by the original composite heuristics by Allahverdi and Aldowaisan.

Reviews

Required fields are marked *. Your email address will not be published.