摘要
流水车间的作业排序（Ｆｌｏｗｂｓｈｏｐｓｃｈｅｄｕｌｉｎｇ）问题是生产管理与组合优化领域研究的重要课题。禁止搜索（ＴａｂｕＳｅａｒｃｈ）算法对于这类问题具有较强的寻优能力。本文针对流水车间的作业排序问题设计了一种禁止搜索算法的实现形式，通过大量的算例分析表明，该算法具有良好的寻优性与运算效率。
We describe an approximation algorithm for the minimum makespan in a flow shop.The algorithm is based on tabu search,a generalization of the well known iterative improvement approach to combinatorial optimization problems.The algorithm in this paper is proved effective and efficient both in computation and comvergence by analyzing the results of some experiments on it.
出处
《航空计算技术》
1999年第1期43-48,共6页
Aeronautical Computing Technique
