平行机的供应链排序

doi:10.12341/jssms08939

系统科学与数学 ›› 2010, Vol. 30 ›› Issue (2): 274-282.DOI: 10.12341/jssms08939

平行机的供应链排序

陈荣军(1), 唐国春(2)

(1)常州工学院数学系, 江苏 213002; 上海第二工业大学管理工程研究所, 上海 201209;(2)上海第二工业大学管理工程研究所, 上海 201209

收稿日期:2008-05-12 修回日期:1900-01-01 出版日期:2010-02-25 发布日期:2010-02-25

PDF ( 510 ) 引用被引次数 ( 26 | 8 )

陈荣军;唐国春. 平行机的供应链排序[J]. 系统科学与数学, 2010, 30(2): 274-282.

CHEN Rongjun;TANG Guochun. Supply Chain Scheduling with Parallel Machines[J]. Journal of Systems Science and Mathematical Sciences, 2010, 30(2): 274-282.

Supply Chain Scheduling with Parallel Machines

CHEN Rongjun(1), TANG Guochun(2)

(1)Department of Mathematics, Changzhou Institute of Technology, Jiangsu 213002;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209;(2)Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209

Received:2008-05-12 Revised:1900-01-01 Online:2010-02-25 Published:2010-02-25

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

关键词： 供应链排序, 制造商问题, 平行机, 近似算法.

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.

Key words: Supply chain scheduling, manufacture's problem, parallel machine, heuristic algorithm.

MR(2010)主题分类:

90B35

分享此文:

[1]	陆少军，裴军，刘心报，杨善林. 考虑恶化和学习效应的多机制造系统智能优化方法[J]. 系统科学与数学, 2019, 39(10): 1597-1608.
[2]	王磊，张玉忠，邢伟. 加工时间离散可控的分批配送排序问题[J]. 系统科学与数学, 2016, 36(10): 1652-1658.
[3]	张玉忠，苗翠霞. 机器有使用限制的混合恶化排序问题的复杂性[J]. 系统科学与数学, 2015, 35(6): 685-694.
[4]	王磊，张玉忠，柏庆国. 单机带有可拒绝的供应链排序问题[J]. 系统科学与数学, 2014, 34(9): 1044-1050.
[5]	王磊，张玉忠，王成飞. 机器具有学习效应的供应链排序问题[J]. 系统科学与数学, 2013, 33(7): 799-806.
[6]	姜春艳，李改弟. 软容量约束的动态设施选址问题的近似算法[J]. 系统科学与数学, 2012, 32(4): 476-484.
[7]	陈荣军，唐国春. 同类机下的供应链排序及转包策略*[J]. 系统科学与数学, 2012, 32(1): 53-61.
[8]	钟雪灵, 王国庆, 程明宝, 李晓春. 带强制工期的可中断平行机排序问题[J]. 系统科学与数学, 2011, 31(7): 794-803.
[9]	王磊;王国庆;易余胤. 交货期可以指派的供应链排序问题[J]. 系统科学与数学, 2010, 30(12): 1622-1630.

阅读次数

全文

摘要