摘要
考虑极小化加权总完工时间的一类无界的不相容工件族分批排序问题,给出了最优排序的性质和算法,并加以证明.对工件有k个到达时间的情形,给出了一个复杂性为O(2^(k-1)nlogn)的启发式算法.
This paper considers the unbounded parallel batch scheduling problem with incompatble job families to minimize the weighted total completion time. It gives the nature of the optimal scheduling and algorithms, and proves it. It further gives a heuristic with the complexity of the situation where there are job release dates.
出处
《常熟理工学院学报》
2009年第4期22-24,共3页
Journal of Changshu Institute of Technology
基金
国家自然科学基金(10671183)资助项目
