A Study of Heuristic Algorithm for AFS Machine Scheduling Problem

摘要：

Because scheduling problem F2|m<,1>≥2,m<,2>=1|C <,max> proves to be NP-complete, no good algorithm is set already. In this paper, a heuristic algorithm is presented to find suboptimal solution and provided that the upper bounds of the performance ratio in the worst case for the heuristic algorithms are 2, which is illustrated to be achievable for the algorithm.

关键词： scheduling Assembly flow shop NP-complete heuristic algorithm performance ratio

作者: Xuhua Lu Qingnong Su Rong Hu

作者单位: College of Science, Wuhan University of Science and Technology, Wuhan, China

会议类型: 国际会议

会议名称: 2006现代科技国际研讨会(The International Workshop on Modern Science and Technology in 2006)

会议地点: 北京

会议语种:英文

页码: 510-513

在线出版日期: 2006-04-01（万方平台首次上网日期，不代表论文的发表时间）