CAT SWARM OPTIMIZATION TO SOLVE FLOW SHOP SCHEDULING PROBLEM

摘要

Flow shop problem is a NP-hard combinatorial optimization problem. Its application appears in logistic, industrial and other fields. It aims to find the minimal total time execution called makespan. This research paper propose a novel adaptation never use