Back to Search
Start Over
Solving multi-objective parallel machine scheduling problem by a modified NSGA-II.
- Source :
-
Applied Mathematical Modelling . Jun2013, Vol. 37 Issue 10/11, p6718-6729. 12p. - Publication Year :
- 2013
-
Abstract
- Abstract: In this paper, we modify a Multi-Objective Evolutionary Algorithm, known as Nondominated sorting Genetic Algorithm-II (NSGA-II) for a parallel machine scheduling problem with three objectives. The objectives are – (1) minimization of total cost due tardiness, (2) minimization of the deterioration cost and (3) minimization of makespan. The formulated problem has been solved by three Multi-Objective Evolutionary Algorithms which are: (1) the original NSGA-II (Non-dominated Sorting Genetic Algorithm–II), (2) SPEA2 (Strength Pareto Evolutionary Algorithm-2) and (3) a modified version of NSGA-II as proposed in this paper. A new mutation algorithm has also been proposed depending on the type of problem and embedded in the modified NSGA-II. The results of the three algorithms have been compared and conclusions have been drawn. The modified NSGA-II is observed to perform better than the original NSGA-II. Besides, the proposed mutation algorithm also works effectively, as evident from the experimental results. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0307904X
- Volume :
- 37
- Issue :
- 10/11
- Database :
- Academic Search Index
- Journal :
- Applied Mathematical Modelling
- Publication Type :
- Academic Journal
- Accession number :
- 89108051
- Full Text :
- https://doi.org/10.1016/j.apm.2013.01.050