Robust scheduling for flexible job shop problems with random machine breakdowns using a quantum behaved particle swarm optimisation

Manas Ranjan Singh, S.S. Mahapatra and Ratikanta Mishra

International Journal of Services and Operations Management, 2015, vol. 20, issue 1, 1-20

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.

Keywords: flexible job shops; job shop scheduling; quantum PSO; particle swarm optimisation; QPSO; makespan reduction; robust measures; machine breakdown; random breakdowns. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=65969 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:20:y:2015:i:1:p:1-20

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().