FMS Scheduling problem is one of the most difficult NP-hard combinatorial optimization problems. Therefore, determining an optimal schedule and controlling an FMS is considered a difficult task. To achieve high performance for an FMS, a good scheduling system should make a right decision at a right time according to system conditions. It is difficult for traditional optimization techniques to provide the best solution. This paper focuses on the problems of determination of a schedule with the objective of minimizing the total make span time. An attempt has been made to generate a schedule using Genetic Algorithm with Roulette Wheel Base Selection Process. © 2012 Springer India Pvt. Ltd.
CITATION STYLE
Sharma, D., Singh, V., & Sharma, C. (2012). GA based scheduling of FMS using roulette wheel selection process. In Advances in Intelligent and Soft Computing (Vol. 131 AISC, pp. 931–940). https://doi.org/10.1007/978-81-322-0491-6_86
Mendeley helps you to discover research relevant for your work.