Abstract: The majority of large size job shop scheduling problem is non-polynomial-hard (NP-hard). In the past decades, GAs have demonstrated considerable success in providing efficient solutions to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback