摘要
本文研究两台平行同类机的一个半在线排序问题。当机器是有准备时间的同类机时,总加工时间已知,文章给出了一个竞争比至少为的半在线算法,同时给出了证明。
This paper analyses semi on - line scheduling problems on two machine system. If the machine is uniform ones with available time, it is assumed that the total processing time is known in advance. And a semi on - line algorithm with the competitive ratio at least is proved.
出处
《湖北教育学院学报》
2007年第8期8-9,共2页
Journal of Hubei Institute of Education
关键词
半在线
排序
竞争比
semi on- line algorithm
scheduling
competitive ratio
