Agility in two-stage hybrid flow shop parallel machine scheduling through simulated annealing
by C. Arumugam, K. Raja, V. Selladurai
International Journal of Services and Operations Management (IJSOM), Vol. 3, No. 3, 2007

Abstract: The problem of flexible hybrid flow shop scheduling with identical and non-identical parallel machines in one or more stages has been considered with the objective of minimising the makespan. A Simulated Annealing (SA) approach has been developed to select the best solutions in a flexible hybrid flow shop scheduling. The SA approach identifies the best sequences for the given set of jobs in a 2-stage/2-machine and 2-stage/3-machine hybrid flow shop problems. The extent of deviation of the performance measures owing to the flexibility in the arrangement of machines in the two stages has been analysed. The proposed SA algorithm has been applied to benchmark problems taken from Taillard (1993). A comparison of the solutions yielded by the ant-colony algorithm by Stuetzle (1998), called Max-Min Ant System (MMAS) and the SA algorithm developed in this paper, with the heuristic solutions given by Taillard is undertaken with respect to the minimisation of makespan. The comparison shows that the proposed SA algorithm performs better on the average, than the MMAS.

Online publication date: Sat, 07-Apr-2007

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 Services and Operations Management (IJSOM):
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