Title: Multi-machine flow shop scheduling problems with rejection using genetic algorithm

Authors: Mohammadreza Dabiri; Soroush Avakh Darestani; Bahman Naderi

Addresses: Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Qazvin, Iran ' Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran ' Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Karaj, Iran

Abstract: This work is a study on scheduling problem with rejection on a set of multi-machine in a flow-shop scheduling system. This paper will attempt to indicate development of a multi-machine flow-shop scheduling model considering rejection (this problem is NP-hard due to the NP-hardness of the same problem variation on a two-machine). We analyse the quality of a solution with two criteria: one is the make span and the one is the total rejection cost. The aim of this study is to present an approximation algorithm and three heuristic algorithms and a genetic algorithm (GA) and successfully applied to Multi-machine flow-shop scheduling model considering rejection to minimise the make span plus total rejection cost. Several tests problems were carried out to assess the performance of the proposed algorithms. We can conclude here that the GA is the most functional algorithm, followed by the approximation algorithm.

Keywords: flow-shop scheduling; scheduling with rejection; approximation algorithm; genetic algorithm; GA; two-level chromosome.

DOI: 10.1504/IJSOM.2019.097527

International Journal of Services and Operations Management, 2019 Vol.32 No.2, pp.158 - 172

Received: 13 Jan 2016
Accepted: 20 Dec 2016
Published online: 28 Jan 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article