Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling Online publication date: Thu, 01-Dec-2016
by Suchithra Rajendran; Chandrasekharan Rajendran; Rainer Leisten
International Journal of Operational Research (IJOR), Vol. 28, No. 1, 2017
Abstract: In this paper, we propose two new heuristic tie-breaking rules in the implementation of the well-known NEH heuristic for permutation flow-shop scheduling. While implementing this heuristic, it is known that ties do frequently occur when the initial ordering of jobs is obtained and when the choice of the best partial sequence among the sequences having the same makespan is done. In this paper, we propose two heuristic tie-breaking rules called NEHMSWG and NEHMinS-PS. We investigate their performance and that of the best-known heuristic tie-breaking rule, relative to the optimal/best-known upper bounds on the makespan, by considering benchmark permutation flow-shop scheduling problem instances. The results of performance evaluation reveal that the proposed tie-breaking rules are simple and effective, and improve the solutions with respect to many problem instances in comparison to the best known heuristic rule reported in the literature.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook