1) pre-evacuation time
疏散准备时间
1.
The present paper aims to introduce the authors' study on the pre-evacuation time for the occupants and its effect on the fire risk assessment.
作为人员疏散时间中重要组成部分的疏散准备时间服从概率分布,而通常计算中往往将其简单取为常数。
2) evacuation time
疏散时间
1.
Influence of transport mode choice on evacuation time in mixed traffic flow evacuation simulations
城市混合流疏散中不同交通方式配比对疏散时间的影响
2.
The paper discusses engineering calculation of evacuation time based on crowd dynamics,in order to correct the error and give some improvement to the existing calculation method a comprehensive calculation method is given,in which pre-movement factor and interaction factor are introduced.
应用人群动力学理论来研究人群疏散时间的工程计算问题,为解决现有计算方法的误差,合理引入疏散时间延迟因子和人员相互作用因子,提出了疏散时间的综合计算方法,该方法对现行的工程计算方法进行了改进和补充,并运用building EXODUS软件的模拟结果对综合计算方法进行了初步检验。
3.
In this paper,a computational evacuation discrete time model(EDTM)has been presented to analyze the building egress evacuation time problem with previous works,and discusses the advantages of the use of the modified model over the use of the previous model.
基于人群流动理论和离散计算方法对传统疏散时间计算公式进行了改进,并提出了疏散离散时间计算模型(EDTM)。
4) 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.
讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。
5) 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.
针对机器速度和准备时间不同,探讨了带机器准备时间的两台同类机半在线排序问题,以达到优化工作效率的目的。
6) 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-困难的。
补充资料：设备安装前的准备工作——技术准备
| 设备安装前的准备工作——技术准备 | ||
|
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条