325
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

Multi-objective biased randomised iterated greedy for robust permutation flow shop scheduling problem under disturbances

ORCID Icon, ORCID Icon & ORCID Icon
Pages 1847-1859 | Received 08 Aug 2018, Accepted 02 Jun 2019, Published online: 12 Jul 2019
 

Abstract

Nowadays, scheduling problems under different disruptions are a key to become competitive in the global market of this century. Permutation flow shop scheduling problems are very important as they consider one of the important types of scheduling problems. In this paper, we consider a challenging scheduling problem of a permutation flow shop in the presence of different types of real-time events such as new job arrival and machine breakdown. A multi-objective optimisation model that takes into account multiple performance measures in order to minimise the effect of different real-time events is used in this paper. To solve this problem, we apply the proposed multi-objective model and adapt a predictive-reactive based Biased Randomised Iterated Greedy approach for the problem, which is hybridised a Biased Randomisation process and the Iterated Greedy algorithm. Furthermore, the proposed approach is compared against the predictive-reactive based Particle Swarm Optimisation method for the same problem. Additionally, to show the efficiency of the proposed model, we compare this model by testing the predictive-reactive based BRIG approach to two other models: the bi-objective model that consider only two objectives and the classical single-objective model of minimising the makespan. Further statistical analysis is performed in this study by using an Analysis of Variance measure. The extensive experiments and statistical analysis demonstrate that the proposed multi-objective model is better than the other models in reducing the relative percentage deviation. Additionally, despite their simplicity, the BRIG algorithm is shown to be state-of-the-art method that outperforms the Particle Swarm Optimisation algorithm.

Disclosure statement

No potential conflict of interest was reported by the authors.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 277.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.