The efficient selection methods of genetic algorithm used in scheduling problems
International Journal of Development Research
The efficient selection methods of genetic algorithm used in scheduling problems
Received 10th July, 2018; Received in revised form 29th August, 2018; Accepted 27th September, 2018; Published online 29th October, 2018
Copyright © 2018, Hani A. AL-Rawashdeh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The performance of a genetic algorithm (GA) depend on many factors: the selection method is one of them. It is well known that the genetic algorithm efficiency depends to a high degree upon the selection of the good GA operators and parameters that suitable to the different scheduling problems. In this paper, we find the selection methods of genetic algorithm that are more suitable for scheduling problem. Also, a number of selection methods used in scheduling problem have been described in this paper like random selection, roulette wheel selection, rank selection and tournament selection. The make span is the measure of performance used to evaluate the genetic selection methods. This paper will help researchers in selecting appropriate selection methods for different scheduling problems for better results.
