中文摘要：

考虑了多制造商多客户的供应链排序问题.由于工件属于不同的种类,同一制造商在加工不同种类工件之前要有一个安装时间.由同一制造商为同一客户加工的工件可分批运输,每一批都有相应的运输时间和费用.以总加权配送时间和总运输费用之和作为优化的目标,给出了有效的动态规划算法,并证明了此算法是多项式可解的.

英文摘要：

This paper addresses the problem of more manufacturers and multiply customers.Since the jobs belong to different job families,a setup time is incurred before the same manufacturer processes a new family of jobs.The jobs that are processed by the same manufacturer for the same customer can be batched to transport,and each batch has a corresponding transportation time and cost.The paper＇s goal is to minimize the total weighted delivery time of jobs and total transportation cost of jobs.The appropriate dynamic programming algorithm is given,and the algorithm is polynomial solvable is proved.