摘要
研究工件既可以在制造商的同类机上加工,又可以一定费用分包给某承包商加工的排序决策问题·假设制造商有若干承包商,每个承包商有足够多机器用于加工工件·制造商需要确定被分包的工件集,以及未分包工件的加工顺序,使得工件最大完工时间与加工、分包费用线性和最小.证明问题的NP困难性,用数学规划及组合方法设计了问题的近似算法,并分析算法性能比与渐近性.
The purpose of this paper is to study a problem on joint decisions of jobs＇ out- sourcing and scheduling. In this problem, jobs can be either processed on uniform machines at the manufacturer or outsourced to one of the available subcontractors possibly for being processed at costs. The manufacturer has several subcontractors and each of which has enough machines to process the outsourced jobs. The manufacturer needs to determine which jobs should be produced in-house and which jobs should be outsourced. Furthermore, it needs to determine a production schedule for jobs in-house. The objective is to minimize the weighted sum of makespan, production and outsourcing cost. We first show the NP~ hardness of the problem. Then, we develop an approximation algorithm with worst-case and asymptotic performances analysis by mathematical programming and combinatorial methods.
作者
陈荣军
唐国春
CHEN RONGJUN;TANG GUOCHUN(Department of Mathematics, Changzhou Institute of Technology, Changzhou 213032;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209)
出处
《应用数学学报》
CSCD
北大核心
2017年第6期801-808,共8页
Acta Mathematicae Applicatae Sinica
基金
国家自然科学基金(71371120)资助项目
关键词
排序
分包
同类机
近似算法
scheduling
outsourcing
uniform machines
approximation algorithm
作者简介
E—mail：chenrjecust@163．com
