基于缓冲区的同型机物资调度优化  

Material Scheduling Optimization Problem of Two Parallel Machines Based on Buffer

作　　者：李鹏举[1] 

机构地区：[1]苏州工业园区服务外包职业学院,江苏苏州215123

出　　处：《江南大学学报（自然科学版）》2011年第4期491-494,共4页Joural of Jiangnan University (Natural Science Edition)　

摘　　要：现代物流运输车辆调度方法复杂多变。将缓冲区引入物流调度中,解决物资冗余的问题;分析了带缓冲区的两台同型机半在线调度优化问题,目标为最大化最小机器加工时间,给出了一个竞争比至少为2/3的半在线算法。Methods of scheduling vehicles is complex in modern logistics transport. A buffer redundancy is introduced in logistics scheduling. In this paper, we consider a semi on-line logistics scheduling problem on two parallel machine system with a buffer, where the objective is to minimized makespan of the schedule. We propose a semi on-line algorithm with the competitive ratio, which is not less than 2/3.

关 键 词：调度问题 缓冲区 半在线算法 竞争比 

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