摘要
讨论具有连续资源的单机成组排序问题.这一模型中同一组内的工件不允许分开加工,各工件组的安装时间是所消耗资源的非负减少连续函数,工件的加工时间是开工时间的严格减少函数.针对满足资源消耗总量限制条件下极小化最大完工时间的问题,以及在满足最大完工时间限制条件下极小化资源消耗总量的问题,讨论了最优排序的某些特征,分别给出了求解最优资源分配的方法.最后通过数值例子表明了所提出方法的正确性和有效性.
The single machine group scheduling with continuous resources is discussed. In this model, the jobs in the same group shouldn＇t be separated, the setup time of a group is a positive decreasing function of the amount of resources consumed, and the processing time of a job is a strictly decreasing linear function of its starting time. For the total resource consumption minimization problem under the makespan constrains, and the makespan minimization problem under the total resource consumption constrains, the characterizations of optimal schedules are discussed, and the optimal allocation methods are presented respectively. We also illustrate them by examples.
出处
《控制与决策》
EI
CSCD
北大核心
2008年第12期1413-1416,1422,共5页
Control and Decision
基金
国家自然科学基金重点项目(70431003)
国家自然科学基金创新群体项目(60521003)
国家科技支撑计划项目(2006BAH02A09)
关键词
单机排序
成组技术
资源约束
安装时间
Single-machine scheduling
Group technology
Resource constrained
Setup time
