【摘要】 流水车间调度问题是一类经典的NP完全问题,为此提出了一种求解极小化总完工时间的流水车间调度问题的改进遗传算法。该算法采用构造型启发式算法和随机方法共同产生初始种群,结合禁忌搜索算法的局部搜索性能和遗传算法的全局搜索性能。仿真实例的结果表明该算法对问题求解的可行性和有效性。更多还原

【Abstract】 Flowshop scheduling is proved to be a NP-complete problem.In order to solve this problem,a method based on an improved genetic algorithm is developed to minimize flowtime of jobs.This method generates initial species by means of constructive heuristic algorithm and random method and obtains an optimal solution by combining taboo search with standard genetic algorithm,which improves the local and global search property.Results of computational experiment indicate that the proposed improved genetic algorithm is feasible and effective in solving flowshop scheduling problem.更多还原