所考虑的供应链排序系统为:若干个不同的元件供应商向一产品加工商供应产品元件,产品加工商等所有的元件都加工完成后再开始最后阶段的加工即成品加工;假定成品完工时间是所有元件中最后完工的元件的完工时间(即成品加工是无瓶颈的且将工时设为零);目标函数是极小化工件所有元件的带权的完工时间之和。对于问题As||∑si=1∑nj=1WijCij,设计出了它的一个计算时间为(n2logn)的多项式时间算法. The considered supply chain sequencing system consists of a number of different component vendors supplying product components to a product processor, processing of all components of the product processor, and then starting the final stage of processing ie finished product processing; assuming that the finished product completion time Is the completion time of the last completed component of all components (ie, the finished product is bottleneck-free and sets the working hours to zero); the objective function is to minimize the weighted completion time of all components of the artifact. For the problem As || Σsi = 1Σnj = 1WijCij, we design a polynomial time algorithm whose computation time is (n2logn).