摘要
以最小化时间表长为目标函数,对具有学习效果的两机流水车间调度问题进行研究.由于工序加工时间引入了学习效果,传统的Johnson法则和NEH启发式算法不再适用.针对该问题的NP-hard特性,提出了JNEH和MNEH两种求解问题的多项式启发式算法.计算机数据实验证明了新的启发式算法求解问题的可行性和有效性;表明了JNEH启发式算法和MNEH启发式算法对小规模问题求解的精度更高、稳定性更好;同时证明MNEH启发式算法对求解大规模问题具有比传统算法更好的寻优性能和鲁棒性.
The problem of flowshop scheduling with the effect of learning to minimize makespan is studied. It is shown in this paper that with the introduction of learning to operation processing times, the optimal schedule for two machine flowshop problem is different from that of the classic version of the problem. Two heuristics are proposed to solve this problem in polynomial time. Extensive computational experiments carried out prove the feasibility and effectiveness of the proposals; and show that both of the proposed JNEH and MNEH heuristic algorithms perform the existing heuristics better for small problems in solution accuracy; while the performance of the MNEH heuristics is efficient and robust for large problems.
出处
《武汉理工大学学报（交通科学与工程版）》
2007年第5期931-934,共4页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
基金
国家自然科学基金项目(批准号:6057407070271033)资助
作者简介
黄敏镁：女，28岁，博士生，讲师，主要研究领域为预测、决策与信息系统
