摘要
实际生产过程中由于各种客观因素的影响,交货期往往具有不确定性.对模糊交货期下置换FlowShop调度问题以及禁忌搜索算法的邻域、禁忌表和搜索策略进行研究,提出一种求解该问题的禁忌搜索算法.仿真结果表明,此算法不仅可以解决模糊交货期下的最小满意度最大化问题,而且具有较高的效率.
Due date often has uncertainty in actual production process owing to various objective factors. The fuzzy due data permutation flow shop scheduling, the neighborhood, Tabu list and searching strategy are studied. Tabu search heuristic algorithm to solve the problem is proposed. Simulation results show that the algorithm can efficiently solve the maximization problem with minimum satisfaction under fuzzy due date.
出处
《大连铁道学院学报》
2005年第2期68-70,共3页
Journal of Dalian Railway Institute
基金
辽宁省教育厅科学研究计划资助项目(2004D113)
