A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem
by B. Shahul Hamid Khan, Kannan Govindan
International Journal of Advanced Operations Management (IJAOM), Vol. 3, No. 1, 2011

Abstract: Exact and heuristic algorithms have been proposed over the years for solving static permutation flow shop scheduling problems with the objectives of minimising makespan, total tardiness, and total flow time, etc. Of late, attempts are being made to consider more than one objective at a time, and develop algorithms in order to obtain a set of Pareto-optimal solutions. In such multi-objective scheduling problems, it is common to obtain a set of Pareto-optimal or efficient solutions such that at least one such solution is not inferior to any other given solution not contained in the set, and the solutions in that set does not dominate each other. In this paper, we consider a multi-objective permutation flow shop problem with the aim of generating non-dominated solutions with the aim of minimising makespan and maximum tardiness of jobs. A multi-objective simulated annealing (MOSA) algorithm has been developed towards this purpose. The proposed algorithm is evaluated using randomly generated problems. The efficiency of proposed algorithm, based on some comparison metrics, is compared with a distinguished multi-objective genetic algorithm known as strength Pareto evolutionary algorithm II (SPEA-II) and multi-objective genetic local search (MOGLS). The computational results show that the proposed MOSA performs better than SPEA-II and MOGLS.

Online publication date: Tue, 30-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 Advanced Operations Management (IJAOM):
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