CAJ | 학술논문

所考虑的供应链排序系统为:若干个不同的元件供应商向一产品加工商供应产品元件,产品加工商等所有的元件都加工完成后再开始最后阶段的加工即成品加工;假定成品完工时间是所有元件中最后完工的元件的完工时间(即成品加工是无瓶颈的且将工时设为零);目标函数是极小化工件所有元件的带权的完工时间之和.对于问题As||sΣi=1 nΣj=1 WijCij,设计出了它的一个计算时间为(n2logn)的多项式时间算法.
소고필적공응련배서계통위:약간개불동적원건공응상향일산품가공상공응산품원건,산품가공상등소유적원건도가공완성후재개시최후계단적가공즉성품가공;가정성품완공시간시소유원건중최후완공적원건적완공시간(즉성품가공시무병경적차장공시설위령);목표함수시겁소화공건소유원건적대권적완공시간지화.대우문제As||sΣi=1 nΣj=1 WijCij,설계출료타적일개계산시간위(n2logn)적다항식시간산법.
Supply chain management has been one of the most active topics in manufacturing re-search over the last ten years. In our consider system, there are several suppliers and one manufac-ture. Each supplier provides component parts to the manufacturer. The manufacturer makes products that are depend on all the component parts. Therefore, the manufacturer waits until all the compo-nents for a job have arrived and then initiates a final stage of manufacturing stage, we assume that this final stage is non-bottleneck. The objective function is to minimize the total weighted completion time of the parts. ForAs ||sΣi=1 nΣj=1 WijCij, we firstly provide an efficient algorithm which solves it in time of (n2logn).