Loading...
Please wait, while we are loading the content...
Similar Documents
Novel heuristics for no-wait two stage multiprocessor flow shop with probable rework and sequence dependent setup times
| Content Provider | Semantic Scholar |
|---|---|
| Copyright Year | 2018 |
| Abstract | ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract This paper presents a number of novel heuristics for solving a no-wait two stage multiprocessor flow shop scheduling problem. To fill in a segment of gap in real scheduling problems, two practical assumptions including probable rework and sequence dependent setup times are considered this study. A number of evolutionary algorithms namely, discrete particle swarm optimization (DPSO), adapted imperialist competitive algorithm (AICA) and adapted invasive weed optimization (AIWO) are used in this investigation. Comprehensive calibrations of different parameters’ values are performed. For this purpose, response surface method is employed to select the optimum parameters’ values with the least possible number of experiments. The performances of the algorithms are studied in terms of relative percentage deviation of make-span. The results of the computational experiments confirm superiority of AIWO to the other algorithms. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.irjet.net/archives/V5/i1/IRJET-V5I1248.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
