摘要
针对Flow shop排序问题,提出一种改进的分枝定界法,该算法融入了Gupta启发式算法和分枝定界算法,在保证求得最优解的前提下减少了计算量,提高了效率。实例结果证明算法的有效性。
Presented an improved Branch and Bound（G-B＆B） algorithm for flow shop scheduhng problem. It has merged with the Gupta heuristic algorithm and the Branch and Bound （B＆B） algorithm. This method has improved efficiency to a great extent, the example result showed the effectiveness of the algorithm.
出处
《现代制造工程》
CSCD
2008年第3期25-27,共3页
Modern Manufacturing Engineering
基金
上海市重点学科建设资助项目(T0502)
关键词
排序
分枝定界算法
Flowshop排序问题
启发式算法
Scheduling
Branch and Bound （B＆B） algorithm
Flow shop scheduling problem
Heuristic algorithm
