安装时间受资源约束的单机成组调度问题  

Single machine group scheduling with resources dependent setup time

作　　者：闫杨[1] 赵传立[1] 

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

出　　处：《电机与控制学报》2007年第1期70-73,78,共5页Electric Machines and Control

基　　金：国家自然科学基金项目(10471096);辽宁省教育厅科学研究基金项目(05L417)

摘　　要：针对具有连续资源的单机成组调度问题,建立一类安装时间受资源约束的单机成组调度模型。模型中,同一组内的工件不允许分开加工,各工件组的安装时间是所消耗资源的线性非增连续函数,同一组内的工件具有与时间有关的学习效应。考虑三类问题:第一类问题的目标函数是在满足最大完工时间限制条件下,极小化资源消耗总量;第二类问题是在满足资源消耗总量限制条件下,极小化最大完工时间;第三类问题是在满足资源消耗总量限制条件下,极小化最大完工时间与资源加权消耗总量的加权线性组合。对三类问题分别给出了求解最优资源分配的方法,并通过数值例子说明了算法的有效性。Aiming at the problem of the single machine group scheduling with continuous resources, the model of single machine group scheduling with resources dependent setup time is set up. In this model, the jobs in the same group can not be separated , the setup time of a group is a linear non-increasing function of the amount of resources consumed, and the jobs in the same group have a time dependent learning effect. Three versions of the problem are discussed. In the first one, the objective is to minimize the total resources consumption under the makespan constrains, whereas in the second one, the objective is to minimize the makespan. In the third one, the objective is to minimize the sum of weighted makespan and total weighted resources consumption under the total resources consumption constrains. The optimal allocation methods are presented respectively. It also illustrates the validity of the algorithms by examples.

关 键 词：单机调度 成组技术 资源约束 学习效应 安装时间 

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