Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
GA Based Scheduling of FMS Using Roulette Wheel Selection Process
FMS Scheduling problem is one of the most difficult NP-hard combinatorial optimization problems.