Minimising total flow time in permutation flow shop scheduling using a simulated annealing-based approach
by Dipak Laha, Uday Kumar Chakraborty
International Journal of Automation and Control (IJAAC), Vol. 4, No. 4, 2010

Abstract: This paper presents an efficient simulated annealing algorithm for minimising the total flow time in n-job, m-machine permutation flow shop scheduling problems. Empirical results demonstrate that the proposed approach is competitive with the best three methods in the flow shop literature. Statistical tests of significance are used to validate the improvement in solution quality.

Online publication date: Thu, 30-Sep-2010

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 Automation and Control (IJAAC):
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