Robust scheduling for flexible job shop problems with random machine breakdowns using a quantum behaved particle swarm optimisation
by Manas Ranjan Singh; S.S. Mahapatra; Ratikanta Mishra
International Journal of Services and Operations Management (IJSOM), Vol. 20, No. 1, 2015

Abstract: This paper addresses a robust schedule for a flexible job shop scheduling problem with random machine breakdown. A multi objective framework based on quantum particle swarm optimisation (QPSO) is proposed to generate the predictive schedules that can simultaneously optimise the makespan and the robust measures. The results indicate that the proposed QPSO algorithm is quite effective in reducing makespan in the event that uncertainty is encountered in terms of stochastic machine breakdown. An exhaustive experimental study is conducted to study the effect of different proposed robustness measures on the generated schedules using benchmark problems.

Online publication date: Fri, 17-Apr-2015

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