1) preparation time reduction
减少准备时间
2) Ready time
准备时间
1.
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.
讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。
3) available time
准备时间
1.
In this paper,we consider a semi on-line scheduling problem on two uniform machines with machine available times,where the objective is to minimize makespan of the schedule.
研究了带机器准备时间的两台同类机的半在线排序问题,这里目标函数为极小化最大机器完工时间。
2.
In the first case, if the machines are uniform ones with available time, we assume that the total processing time is known in advance.
当机器为有准备时间的同类机时,总加工时间已知;当机器为有准备时间同型机时,最大加工时间已知。
3.
In the paper,we consider a semi-on-line scheduling problem on two uniform machine system(different machine speed) with different machine available time,to reach the purpose optimizing availability,where the objective is to minimize makespan of the schedule.
针对机器速度和准备时间不同,探讨了带机器准备时间的两台同类机半在线排序问题,以达到优化工作效率的目的。
4) release time
准备时间
1.
This paper considers the open shop scheduling problems with job priorities and release times.
研究了具有优先权的自由作业时间表问题,在工件具有准备时间的条件下,给出一种新的启发式算法,其最坏性能比不超过2,猜想该算法的紧界是2-2/(m+1),其中m是机器的台数。
2.
It was proposed that all release times existed and all processing times were constant,the problem was still NP-hard in the strong sense.
在工件具有准备时间且所有加工时间等于1的条件下,证明该问题是强NP-困难的。
5) release times
准备时间
1.
On the complexity of the two-machine open shop problem with delays and release times;
具有准备时间和延迟时间的自由作业问题的复杂性
2.
The paper presents open-shop scheduling problem with release times and job priorities, we give a simple heuristic and prove that its worst-case performance is 4/3, the bound is tight.
研究具有优先权和准备时间的自由作业时间表问题 ,在稠密时间表的情况下 ,给出一种启发式算法 ,猜想该算法的紧界是 2 -2 /( m +1 ) ,其中 m是机器台数 。
3.
We consider the m-machine flow-shop problem with release times and we prove the worst-case performance is m+12.
本文研究具有准备时间的流水作业时间表问题 ,给了一个简单的启发式算法 ,证明了一个简单的启发式算法的最坏性能比是 m + 12 (其中m是机器的台数 ) ,且关于上界是紧的 。
6) planning time
准备时间
1.
The difference in planning tim
本研究基于三个问题:场独立型和场依赖型学习者分别在二语言语行为表现的准备时间、语用流利度和得体性有何差异?并且,根据Blum-Kulka(1989)使用的“请求”分析框架和Nelson et al(2002)的“拒绝”分析框架建立本文的数据分析框架并对FD/FI的语料进行了分析。
2.
Based on an investigation of the performance of 20 high learners and 20 low learners in a written task with/without planning time,we analyzed the influence of planning time and language proficiency on learners\' written accuracy.
通过分析20名高水平非英语专业大学生和20名低水平非英语专业大学生在有、无准备时间的条件下完成一项图片写作任务中的文字材料,考察了准备时间和语言水平对中国学生写作表达的准确性的影响。
补充资料：设备安装前的准备工作——技术准备
| 设备安装前的准备工作——技术准备 | ||
|
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条