Effects of dummy machines on make span in a few classical heuristics using Taillard bench mark problems
by A. Baskar; M. Anthony Xavior
International Journal of Materials and Product Technology (IJMPT), Vol. 45, No. 1/2/3/4, 2012

Abstract: Finding an optimal sequence in terms of total completion time for processing 'n' jobs in 'm' processing centres in the shop floor is an important job for a shop floor supervisor. The problem is NP hard as the total number of sequences is (n!) for a permutation flow shop scheduling problem. After the invention of evolutionary algorithms and meta heuristics, finding an optimal sequence becomes comparatively easier. However, in the shop floor, due to the limitation in the computing capabilities and computer knowledge, still the classical heuristics are popular because of their simplicity. However, in most of the cases, only one sequence is obtained except in CDS algorithm where the best sequence is selected from (m-1) alternatives. This paper deals with finding more than one sequence having optimal/near optimal make span in a permutation flow shop scheduling problem using the concept of dummy machine. The concept is used with some of the classical heuristics like CDS, Palmer slope index method, RA method. The effect of dummy machine is analysed using the well known Taillard bench mark problems. The codes are generated in MATLAB and the results are satisfactory.

Online publication date: Thu, 18-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Materials and Product Technology (IJMPT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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