转包且具有不同费用时间段的排序问题（英文）  

SCHEDULING WITH OUTSOURCING AND VARIABLE TIME SLOT COSTS

作　　者：陈荣军[1] 秦立珍[1] 唐国春[2] 

机构地区：[1]常州工学院数学系,江苏常州213002 [2]上海第二工业大学管理工程研究所,上海201209

出　　处：《数学杂志》2015年第5期1068-1074,共7页Journal of Mathematics

基　　金：Supported by National Natural Science Foundation of China(71371120;61475027)

摘　　要：本文研究制造商可以将工件转包给承包商加工的排序模型,承包商仅有一台机器,转包费用由分配给转包工件的不同时间段费用确定.本文分别研究制造商有一台单机及两台自由作业机器环境情形,需要确定被转包工件集及全部工件的加工顺序,使得工件最大完工时间与转包费用和最小.本文利用归约方法对制造商每个机器环境,证明问题NP困难性,并提出动态规划算法.This paper is concerned with scheduling model where each job can be either processed at a manufacturer or outsourced to a subcontractor which has a single machine for processing. The outsourcing cost that the subcontractor charges the manufacturer is determined by the cost of time slots allocated to the outsourced jobs. This paper considers that the manufacturer has a single machine or two open-shop machines environment. The manufacturer needs to determine simultaneously the set of outsourced jobs and the schedule of the all jobs such that the sum of the makespan of all jobs and the outsourcing cost is minimized. For each machine environment at the manufacturer, we show the problem is NP-hard by reduction method and derive a dynamic programming algorithm.

关 键 词：排序 转包 自由作业 时间段 

分 类 号：O221.7[理学—运筹学与控制论] O224[理学—数学]