Multi-machine flow shop scheduling problems with rejection using genetic algorithm
by Mohammadreza Dabiri; Soroush Avakh Darestani; Bahman Naderi
International Journal of Services and Operations Management (IJSOM), Vol. 32, No. 2, 2019

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.

Online publication date: Mon, 28-Jan-2019

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