1) Semi-online
半在线
1.
On-line and Semi-online Scheduling Problems on m Parallel Machines with Non-simultaneous Machine Available Times;
带机器准备时间的m台平行机在线和半在线排序
2.
Online,semi-online algorithms for machine covering with non-simultaneous machine available time;
带机器准备时间的机器覆盖问题的在线、半在线算法
2) 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)两个复合信息下的同型平行机半在线排序问题。
3) Semi on-line scheduling
半在线调度
4) semi on-line algorithm
半在线算法
1.
For the case that the total processing times being known in advance,we propose a semi on-line algorithm with the competitive ratio max{5+12,1+bb},and we prove that the algorithm is the best on two identical machines with machines available times whenb<2.
对于所有工件总的加工时间已知的半在线情形,我们给出了一个竞争比为max{52+1,1+bb}的半在线算法,其中b为机器速度。
5) 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.
近年来，在线排序和半在线排序是两个发展比较迅速的分支。
