机器带传递时间的平行机排序问题
Parallel Machine Scheduling Problem with Machine Delivery Times
本文考虑的是工件带准备时间而机器带传递时间的平行机排序问题，由于问题是NP-hard的，我们给出了一种近似算法，算法的复杂度为多项式的，实例表明算法是有效的。
his paper considers the parallel machine scheduling problem with job prepare dates and machine delivery times, since the problem is NP-hard we give an approximate algorithm and the complexity of the algorithm is polynomial, example shows that our algorithm is effective.
汪洋
自动化技术、自动化技术设备计算技术、计算机技术
平行机排序传递时间近似算法复杂度
parallel machine schedulingdelivery timeapproximate algorithmcomplexity.
汪洋.机器带传递时间的平行机排序问题[EB/OL].(2008-04-29)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200804-995.点此复制
评论