Asymptotically Optimal Algorithm for the Multiprocessor Flow Shop Weighted Completion Time Scheduling Problem
多机Flow Shop加权完成时间调度问题的渐近最优算法研究

Recently,Chou,Queyranne,Simchi-Levi and Liu respectively prove that the heuristics based on weigh- ted shortest processing time among the available jobs are asymptotically optimal for the uniform parallel machine and the flow shop problem scheduling problems.By grouping this machine setting,this paper proves that the heuristic based on weighted shortest processing time among the available jobs is also asymptotically optimal,even for the multi- processor flow shop weighted completion time scheduling problem.