平行机的供应链排序

研究平行机环境下的供应链排序,即研究如何安排工件在平行机上加工,把加工完毕的工件分批发送给下游客户,使得生产排序费用和发送费用总和最少。这里,生产排序费用是用工件送到时间的函数表示;发送费用是由固定费用和与运输路径有关的可变费用两部分组成。研究以工件带权送到时间和作为生产排序费用的供应链排序问题,给出多项式时间近似算法,并分析算法性能比。

SUPPLY CHAIN SCHEDULING WITH PARALLEL MACHINES

In this paper, an integrated scheduling model of production and distribution operations is considered. In this model, a set of jobs (i.e., customer orders) are first processed on parallel machines and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that an objective function that takes into account both production cost and distribution cost is optimized. Production cost is measured by a function of the times when the jobs are delivered to the customers, which is the sum of weighted dilivery times in this paper. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. For this problem, a polynomial time approximation algorithm is given and analysed.