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.
| Original language | English |
|---|---|
| Pages (from-to) | 158 - 172 |
| Number of pages | 15 |
| Journal | International Journal of Services and Operations Management |
| Volume | 32 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 29 Jan 2019 |
| Externally published | Yes |
Keywords
- flow-shop scheduling
- scheduling with rejection
- approximation algorithm
- genetic algorithm
- GA
- two-level chromosome