科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper discusses an efficient approach to reduce the evaluation time in the local search for solving the permutation flow shop problem with makespan objective. Based on the proved theorems, some different formulae are proposed to calculate makespan, which can use as much repeated information from the former calculations. Furthermore, computational experiments are given and compared with those results yielded by one basic method and one improved method in the literature. These results show that the given method is more effective in solving large size instances, in which the calculation time can be greatly reduced.
- 出版日期2007-12
- 单位上海交通大学
