一类带有可控加工时间的单机排序问题  

Single Machine Scheduling Problem with Controllable Processing Times

作　　者：王方[1] 赵传立[1] 

机构地区：[1]沈阳师范大学数学与系统科学学院,沈阳110034

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

基　　金：国家自然科学基金(No.10471096)

摘　　要：讨论了具有学习效应的工期指派和可控加工时间的单机排序问题。工件的实际加工时间同时依赖于所排位置和所分配的资源消耗相关的函数,资源消耗分为线性和凸资源消耗2种。考虑共同工期、松弛工期和没有限制的工期3种工期分派方法。目标是确定工件最优的加工顺序、工期和资源分配量,极小化一个包含提前、延误、工期分派、总完工时间和总资源消耗的总费用函数。对于上述2种不同资源消耗函数与3种不同的工期分派方法的每一种组合,均给出了多项式时间算法。In this paper, we consider due date assignment and single-machine scheduling problems with learning effect and con- trollable processing times. The actual processing time of a job depends on its position in a sequence and related resource con- sumption which contains linear resource consumption or convex resource consumption. The due date assignment methods stud- ied include the common due date, the slack due date and the unrestricted due date. For each combination of the two resource consumption function and three due date assignment methods, we provide a polynomial-time algorithm to find optimal the job sequence, due date values and resource allocation that minimize an objective function which includes earliness tardiness, due date assignment, the total completion times and total resource consumption.

关 键 词：单机 排序 学习效应 资源分配 工期分派 

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