Data includes three sets of benchmark instances for the Ordered Flow Shop Scheduling problem. The benchmarks are entitled as T, S and L, including 120, 240 and 240 instances. Each instance file (in .t
In order to test the feasibility and effectiveness of the algorithm in this paper, NSGA-II-ALS was compared with several other genetic algorithms in experiments to analyze the performance of multiple
We randomly generated two groups of 150 test instances for the problem addressed in this work. The first group contains instances with 100 jobs which must be processed on 2 machines. In the second g
