一类资源约束的单机成组调度问题  

A single-machine scheduling problem with resource constraints

作　　者：闫杨[1] 王大志[1] 汪定伟[1] 王洪峰[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《控制理论与应用》2008年第5期901-904,共4页Control Theory & Applications

基　　金：国家自然科学基金重点资助项目(70431003);国家自然科学基金创新群体资助项目(60521003);国家科技支撑计划资助项目(2006BAH02A09).

摘　　要：本文讨论具有连续资源的单机成组调度问题.在这一模型中,工件组的安装时间是所消耗资源的非负严格减少连续函数,工件的加工时间是开工时间的严格增加函数.考虑两个问题,第1个问题是在满足资源消耗总量限制条件下,极小化最大完工时间.第2个问题的目标函数是在满足最大完工时间限制条件下,极小化资源消耗总量.分别对两个问题讨论了最优调度的某些特征,分别给出了求解最优资源分配的方法,并通过数值例子进行说明.The single-machine group-scheduling problem with constrained resources is discussed. In this model, the setup time of a group is a strictly decreasing function of the amount of resources consumed, and the processing time of a job is a strictly increasing linear function of its starting time. Two optimal problems are discussed. The first objective is to minimize the makespan under the total resource consumption constrains, whereas the second one is to minimize the total resource consumption under the makespan constrains. The characteristics of optimal scheduling are investigated respectively for the two problems, and the corresponding method for optimal allocation of resources are presented. Numerical examples are given to illustrate the approach.

关 键 词：单机调度 成组技术 资源约束 安装时间 算法 

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