1) semi-online scheduling
半在线排序
1.
This paper investigates a semi-online scheduling problem with combination of double information on two uni-form machines.
研究了两台同类机的一个半在线排序问题,当预先知道所有工件的加工时间总和(sum)与最大工件的加工时间(max)及目标为极大化最小机器完工时间的情形时,证明了此问题的竞争比为(3s+2)/(2s+2)的半在线算法。
2.
A semi-online scheduling problem on two identical parallel machines with combination of two types of information is considered.
研究了两台同型平行机的一个复合半在线排序问题。
3.
Recently, on-line and semi-online scheduling are two branches developed faster.
近年来，在线排序和半在线排序是两个发展比较迅速的分支。
2) online scheduling
在线排序
1.
This paper combines together two emerging areas of scheduling research, multiprocessor task problems and fixed interval problems, and takes online scheduling into account, which is more consistent with real life situations.
本文将时下两个新兴的排序研究领域即多处理器任务问题和固定工件问题相结合,并考虑了在线排序的不确定性因素,使其更符合生活实际。
2.
Comparing to the classical off-line scheduling,the obvious feature of online scheduling is that all jobs\' information becomes known to the scheduler only by stages,and the scheduler have to take decisions depending only on the incomplete information of the instance as it is given so far.
在线排序是近年来现代排序领域发展最为迅速的模型之一。
3.
So online scheduling appears.
在线排序是现代排序的一个重要组成部分。
3) on-line scheduling
在线排序
1.
This paper investigates a special case of the on-line scheduling problem on two identical machines with rejection.
讨论一特殊情况的两台可拒绝同型机在线排序问题的近似算法。
2.
This paper investigates on-line and semi on-line scheduling problems on uniform machines with non-simultaneous machine available times.
研究带机器准备时间的m台同类机 (uniformmachines)在线和半在线排序问题 ,目标函数为极小化最大机器 (工件 )完工时间 。
3.
Moreover, on-line scheduling problems attract more attention of people because of its applications in practice.
而在线排序因其研究的内容非常具有实际意义，从而更加引人关注。
5) on-line optimal schedule
在线最优排序
6) semi on-line
半在线
1.
On-line and Semi On-line Algorithm for Scheduling Jobs with Arbitrary Release Times;
工件有任意到达时间的在线与半在线排序问题
2.
A semi on-line version on two uniform machines with the given total processing time is studied.
研究了已知总加工时间的两台同类机半在线问题。
3.
This paper investigates a semi on-line scheduling problem on three identical machines with combined partial information.
本文讨论在已知加工工件总长度(sum)以及机器带一个缓冲区(buffer)两个复合信息下的同型平行机半在线排序问题。
