Particle swarm optimisation algorithm and multi-start simulated annealing algorithm for scheduling batches of parts in multi-cell flexible manufacturing system Online publication date: Mon, 17-Dec-2018
by A.N. Balaji; S. Porselvi; N. Jawahar
International Journal of Services and Operations Management (IJSOM), Vol. 32, No. 1, 2019
Abstract: This paper considers the problem of scheduling batches of parts in a multi-cell flexible manufacturing system (MCFMS) with sequence dependent batch setup time. The goal is to find the best sequence of batches and hence to minimise the makespan. Two mathematical models are developed namely: batch availability model and job availability model. As the problem is known to be NP-hard, particle swarm optimisation (PSO) algorithm and multi-start simulated annealing (MSA) algorithm are proposed to solve the problem. The proposed algorithms are validated by testing the benchmark problems available in the literature. In addition to that, 80 problems with various sizes have been generated at random and then the performance of the proposed MSA and PSO algorithms are compared with CPLEX solver. The experimental results show that MSA provides better solution compared with PSO, the same solution as CPLEX and very close to the lower bound value provided by CPLEX.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook