带有可控加工时间和准备时间的单机排序问题  

Single Machine Scheduling Problem with Controllable Processing Time and Setup under Convex Resource Consumption Costs

作　　者：张雪[1] 罗成新[1] 

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

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

摘　　要：为考察资源分配和退化效应对工件排序的影响,在连续可分但不可再生的资源分配下,工件具有可控准备时间和加工时间的单机排序问题。工件的加工时间是关于退化效应和资源分配的函数,并且在每个工件加工之前,都有一个准备时间,它是有关资源分配的凸函数。本文给出一个最优算法来求解最小化最大完工时间问题。In this paper, we study the single machine scheduling problem, where both setup and job processing times are controllable by allocating a continuously divisible nonrenewable resource. The processing time of jobs is a function of deterioration effects and re- source allocation. Before each job is processed, a setup time is required; it is a convex function of resource allocation. We propose an optimal algorithm to solve the problem of minimizing the makespan.

关 键 词：资源分配 负荷 退化效应 准备时间 单机 

分 类 号：O213[理学—概率论与数理统计]