processing times的意思

processing times中文翻譯：

[機]加工時間；處理時間

相似詞語短語

processing speed───[計]處理速度；加工速率

processing units───生產裝置（processunit的復數形式）

processing plants───制煉廠

closing times───結束營業的時間

lowsing times───減少時間

opening times───營業時間(openingtime的復數)

press times───n.截稿時間

processing plant───n.煉油廠；石油加工廠

processing unit───[計]處理單元；處理部件

雙語使用場景

Landing permits and other authorizations often require long processing times.───著陸許可證或者其它的批文通常需要更復雜的過程和更長的時間。

Message processing times are dictated by service level agreements.───消息處理時間由服務級別協議規定。

Set the sampling interval based on maximum message processing times.───根據最大消息處理時間來設置采樣間隔。

It also did not align with the processing times and cycle times the agency reports in other contexts.───它與處理時間和周期還沒有排列代辦處報告在其它上下文。

Fairness has improved, and the difference between the worst and the best request processing times is only 57%.───結論已經得到證明，并且最差和最佳請求處理時間相差只有57%。

The requirements and processing times depend on the sort of work you will do when you come to Canada.───一些要求和審理時間是隨著你到加拿大所從事的工作種類而定的。

This additional funding will ensure that processing times remain low as the program grows with improving business conditions.───追加的撥款將保證在移民人數增加、辦公條件改善的情況下簽證受理時間仍然可以在較短時間內完成。

To deal with this problem, a proactive scheduling algorithm with uncertain processing times was proposed herein.───針對這一實際問題，提出了一種考慮任務工時不確定性的前攝性車間調度算法。

Correlation among messages enables users to determine processing times of queries and to monitor any security exceptions.───用戶可以根據這些消息之間的相關性判斷查詢的處理時間并監視任何安全異常情況。

英語使用場景

In this paper, a single machine group scheduling problem with resource dependent setup and processing times is discussed.

If you filed at a USCIS Local Office, your case status may not be reviewable online but for processing times on forms filed at that Office please, click here.

A single machine random scheduling with uniform distributed random processing times is considered and the objective is to find an optimal schedule to minimize the expected number of tardy jobs.

Then for the parallel machine problem to minimize the sum of completion times, we show that an optimal schedule can be obtained by sequencing jobs in non-decreasing order of basic processing times.

Set the sampling interval based on maximum message processing times.

This paper proves that the performance ratio could be improved to 5/3 when the processing times are independent of machines or the number of operations is no more than 2.

Processing times are also much reduced due to the lists of words being shorter than the lists of grams.

The objective of this paper is to minimize the delivery time and the batch scheduling problems with job processing times are the same.

In the fuzzy environment that the processing times and the due-dates of jobs are fuzzy parameters, the total completion earliness problem of single machine scheduling is investigated.