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

Mohammadreza Dabiri, Soroush Avakh Darestani and Bahman Naderi

International Journal of Services and Operations Management, 2019, vol. 32, issue 2, 158-172

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. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.inderscience.com/link.php?id=97527 (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:32:y:2019:i:2:p:158-172

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 ().