本文主要考虑平行机半在线排序问题。
This paper studies semi online parallel machine scheduling problems.
针对机器速度和准备时间不同，探讨了带机器准备时间的两台同类机半在线排序问题，以达到优化工作效率的目的。
This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.
钨已授权从私人来源的一些数据，所以没有什么可显示和处理所有的事情是你会发现你的平均通过谷歌搜索在线排序。
Wolfram has licensed some of the data from private sources, so not all of what it can show and process is the sort of thing you'll find online through your average Google search.
Notes即时消息好友联系列表现在包括三个新的选项：仅显示在线联系人、显示简称和对列表进行排序。
Notes instant messaging contact lists now include three new options: show online people only, show short names, and sort list.
像对变量的读写这样的操作，在线程中是根据所谓的“程序顺序”——程序的语义声明它们应当发生的顺序——排序的。
Actions, such as reads and writes of variables, are ordered within a thread according to what is called the "program order" — the order in which the semantics of the program say they should occur.
联系人列表管理，如图2所示，可以排序联系人列表、显示缩写名、只显示在线联系人。
Contacts list management as shown in figure 2: Sort contacts list, show short names, show online contacts only.
本文首先简要介绍了排序问题、竞争比分析和近似算法等基本概念，总结了近年来出现的各个半在线模型及其有关结果。
In the first we introduce basic notions of scheduling problems, competitive analysis and approximation algorithm, summarize semi online models and their results which appear in recent years.
系统成功的实现了在线数字滤波、自动排序、自动识别及数据处理等功能。
The system realizes the on-line digital filteration, automatic sequence arrangement, identification, data processing, etc.
本文理论和实验结果是合理而有效的可以应用到在线文献检索的排序中，改善文献检索的服务质量。
The consequence and the theory of this paper is reasonable and effective, it can be used into the online retrieval arrangement and promote the quality of the document retrieval.
所以让我们来思考一会，要在线性时间能排序，列表里每个元素最多被使用常数次，不一定是一次，对吧。
That one's not so obvious. So let's think about this for a second. To sort a list in linear time, would say, I have to look at each element in the list at most a constant number of times.
所以让我们来思考一会，要在线性时间能排序，列表里每个元素最多被使用常数次，不一定是一次，对吧。
That one's not so obvious. So let's think about this for a second. To sort a list in linear time, would say, I have to look at each element in the list at most a constant number of times.
应用推荐