供应链排序中的外包问题  

The Outsourcing Problem in Supply Chain Scheduling

作　　者：陈立忠[1] 杨栋[1] 张玉忠[1] 

机构地区：[1]曲阜师范大学管理学院,山东日照276826

出　　处：《重庆师范大学学报（自然科学版）》2013年第5期21-26,共6页Journal of Chongqing Normal University:Natural Science

基　　金：国家自然科学基金(No.11071142);山东省自然科学基金(No.ZR2010AM034)

摘　　要：为了更好地将供应链排序和现实生活结合以体现其应用价值,文章研究了一类可以外包的供应链排序模型。外包即指为了提升效率,节省总费用,而采取将工件由其它制造商代替加工的现象。所有的工件均可以在制造商内部加工也可以进行外包加工,外包工件加工完成后必须分批运回制造商才算完工。所研究的模型中有一个制造商和一个外包商,制造商的加工环境为m台平行机,外包商为单台机器。因此在模型中要考虑外包费用、运输延迟以及运输费用,所要做的就是确定外包工件以及工件的加工顺序和外包工件的配送顺序。对于该问题,本文主要研究了目标函数分别为总完工时间、最大延迟以及误工总数的情形;分析了问题的复杂性,运用动态规划的技巧给出了最优算法且分析了算法的时间复杂性。In this paper, in order to combine the supply chain scheduling with real life to reflect its application value, we study the model of supply chain scheduling with outsourcing. Outsoureing is a phenomenon in which manufacture chooses some jobs to be pro- cessed by other manufactures in order to improve the efficiency and save the total cost. All jobs can be either processed by the manu- faclurc in-house or subcontracted to a subcontractor, and when the outsourced jobs had been processed, they must be transported to manufacture. In our model, there is one manufacture and one subcontractor, the manufacture has m machines and the subcontractor has only one machine. So, the outsourcing costs, transportation delay and transportation costs should be taken into consideration. What we must do is to determine what jobs to be subcontracted and the order of job processing and the transportation of outsourcing jobs. With this problem, we analyze the situations when the objective is total completion time, maximum lateness and the number of tardy jobs respectively. Then we analyze the computational complexity of the model, and adopt the technique of dynamic pro- gramming to give their optimal algorithms.

关 键 词：供应链排序 外包 动态规划 最优算法 计算复杂性 

分 类 号：O226[理学—运筹学与控制论]