摘要
根据F′2|m1≥2,m2=1|Cmax排序问题是NP完全问题的论断,提出了AFS问题的两个启发式算法,分别给出了应用启发式算法的实例。
Based on the conclusion that AFSscheduling problem is NPcomplete,two heuristic algorithms are presented and two examples to apply the heuristic algorithm are given.Finally,that the worst case behavior of two heuristic algorithms is 2at most is proved.
关键词
装配式流水作业
排序
启发式算法
性能比
assembly flowshop
scheduling
heuristic algorithm
performance ratio