用禁忌搜索技术解决无等待流水调度问题

Taboo Search Technique for No-Wait Flowshop Scheduling

描述了一种以解决总完工时间最小为目标的无等待流水调度问题的算法.利用启发式方法产生初始解,然后使用禁忌搜索技术改进当前解.对禁忌搜索的邻域结构和搜索策略进行研究.用实际算例进行仿真试验,算法在合理的时间内达到最优值,验证了算法的可行性和有效性.

A algorithm based on taboo search technique is presented for solving the minimum makespan problem of no-wait flowshop scheduling. The algorithm first uses heuristic algorithm structure to generate initial solution, then uses taboo search technique to improve the current solution. The neighborhood and searching strategy are studied. An practican example is applied to carry out the simulation experiment, and the algorithm achieves the optimum value in a rational time, which confirms the validity and the feasibility of the algorithm.