Scheduling jobs on flowshop environment applying simulated annealing algorithm
by R. Rajkumar, P. Shahabudeen
International Journal of Services Operations and Informatics (IJSOI), Vol. 4, No. 3, 2009

Abstract: Simulated Annealing (SA) heuristics have been successfully applied on a variety of complex optimisation problems. This paper investigates the effect of different neighbourhood scheme on the SA process through computational experiments on the permutation flowshop scheduling problem with makespan criterion and proposes an improved SA procedure with a neighbourhood scheme. The test problems are selected from the OR-library and experiment results show that the comparative performances of SA with different neighbourhood schemes and that the proposed SA with a neighbourhood scheme always gives good performance.

Online publication date: Thu, 09-Jul-2009

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 Operations and Informatics (IJSOI):
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