機加工時間 的英文怎麼說

中文拼音 [jījiāgōngshíjiān]
機加工時間 英文
machining time
  • 機 : machineengine
  • 工 : Ⅰ名詞1 （工人和工人階級） worker; workman; the working class 2 （工作; 生產勞動） work; labour 3 ...
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. Abstract : based on a numbers piled up for varies resources ( labor, materials, mechines ) in neuron plan, a composed distribution for various resources was obtained. then, using time difference and quantities of materials, the best selected work and time started as astrictive conditions, the best optimum distribution which satisfied variou resources in difference optimodel and astrictive conditions was got

    文摘:將多種資源（人工、材料、機械）的數量同時在神經網路計劃技術上實行數字化疊加，從而獲得多資源疊加的合成分佈，再利用神經網路計劃技術中各個工作的不同時差和資源數量，按收斂條件選擇最佳開工工作和開工時間，滿足多種資源在優化模式中按收斂條件進行最優分佈
  2. It will save considerable machining time to use more than one tool in one machine to perform several machine operations either in sequence or simultaneously.

    在一臺機器上使用數種刀具來順次或同時進行幾項機器操作，將節省大量加工時間。
  3. Abstract : on the basis of that the proportion of time spent sparking is analyzed in electrical discharge machining ( edm ) process, a new method. which is used to ascertain the trend of discharge gap change, is presented. and a fuzzy control strtegy is introduced to parctical use, the results is well

    文摘:通過對電火花成形機放電狀態的分析，提出了利用分析周期內出現異常放電狀態時間的比例及開路狀態所佔時間的比例，來判別電火花成形加工的間隙放電狀態及其變化趨勢的方法，並在此基礎上利用模糊控制策略實現了對電火花成形加工過程中放電狀態的控制，取得了令人滿意的效果。
  4. Nowadays, the machining center carries through the precision inspection only following the fixed coordinates " axes, which can not completely reflects the real error of the spacial position of the practical machining outside the axes and leads to having no the directive relation between the inspected precision and the practical machining precision. so, this paper introduces that the error factors of influencing workpiece ' s outline on machining and carries out the solid inspection of every spot ' s error inside the workaround on the horizontal machining center

    本文針對當前加工中心僅沿固定的坐標軸線進行精度（含幾何精度和定位精度）檢驗，並不完全反映軸線外實際加工的空間位置真實誤差，導致檢出精度與機床實際加工精度無直接對應關系的現狀，論述了加工時影響工件型面輪廓精度之加工中心的誤差因素，對加工中心實施其工作區內各點誤差的立體檢測。
  5. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    證明了在考慮折扣因子的條件下，模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務，並且被連續加工所得的排序為最優排序：該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上搜索分解樹的方法。
  6. Measuring engine transient process data in ca1258p1k2l11t1 truck in accelerated mode, recording and analyzing the data, then analysis the test error. 4. building model and simulating two typical running mode ? fixed 6th gear acceleration with initial vehicle speed 40km / h and gear change acceleration starting with 2nd gear, comparing calculated result with test result, revising transient process simulation model and analyzing error between calculation

    本文基於ca1258p1k2l11t1載重卡車對ca6df2 - 26發動機的瞬變工況進行試驗和模擬計算，結果表明: 1 ） gt - power軟體可以很好的模擬、分析、預測發動機瞬變過程，模擬計算的結果與試驗結果很接近，試驗證明，預測分析指出的改進方向是正確的; 2 ）加裝電動增壓器可以降低整車使用油耗，改善低速煙度排放，縮短加速時間，改善整車的加速響應; 3 ） gt - power軟體預測分析配合發動機和整車試驗是分析、解決發動機瞬變過程的有力工具。
  7. On the basis of computer simulation, the relationship among plasma channel, plasma configuration and the final crater are clarified

    根據計算機模擬實驗，得出了短、長脈沖加工時瞬時放電通道半徑、放電通道位形半徑以及最終放電痕半徑三者之間的關系。
  8. In modeling, the machine shop based on the color petri net is researched ; in simulation, the object - oriented event activity scanning is used, time - a research is given based on the traditional control algorithms

    在建模方面，主要研究了基於賦色petri網模型的機加工車間系統;在模擬方面，採用面向事件活動掃描模擬模型，在傳統模擬演算法的基礎上提出了時間- a模擬演算法。
  9. The result indicates : the new techno - logy of mechanical peeling, color and luster protection with an average of 2. 0 % humidity and hot wind plus microwave drying can replace the traditional processing, it shorten processing time, promots the processing efficiency

    結果表明，機械去皮、 2 . 0 %噴淋均濕護色、熱風微波乾燥新工藝能較好地替代傳統加工工藝，並起到縮短加工時間、提高加工效率的作用。
  10. According to the number of processors, scheduling problem can be grouped as single - machine scheduling problem and multi - machine scheduling problem. according to whether the job ' s processing time, released time and the surroundings of the processors are deterministic or stochastic, scheduling problem can be grouped as deterministic scheduling problem and stochastic scheduling problem. according to whether the parameters of the jobs are given before - hand, scheduling problem can be grouped as static scheduling problem and dynamic scheduling problem

    按處理機個數將排序問題分為：單機排序問題和多處理機排序問題；根據任務加工時間和到達時間以及處理機的工作環境等數據是確定的或服從某種隨機分佈可分為：確定性排序問題和隨機排序問題；根據所有任務的參數是否是預先給定的可分為：靜態排序問題和動態排序問題。
  11. Single machine scheduling with precedence constraints and processing time dependent on starting time

    具有優先約束和加工時間依賴開工時間的單機排序問題
  12. Abstract : in this paper, we discussed a new kind of single machine scheduling problems with controllable processing times. the objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs ' processing times that deviated from their specified ones. we presented a polynomial algorithm to solve the problem

    文摘:本文討論了一類新的加工時間可控的單機排序問題.我們所考慮的目標函數由所有工件的加權完工時間之和與對所有工件的實際加工時間偏離額定加工時間的最大不滿意程度這兩部分組成.對此問題，我們提出了一個多項式演算法
  13. Multi - rule single machine scheduling problems with discretely controllable processing times are considered

    摘要討論了工件具有離散可控加工時間的單機多準則下的排序問題。
  14. In this paper, we address the single machine scheduling problem with discretely controllable processing times, our objective is to minimize the makespan plus the total processing cost

    摘要考慮工件加工時間離散可控的單機分批排序問題，目標函數是極小化最大完工時間與加工費用之和。
  15. Abstract : a scheduling problem on the single machine with fuzzy processing time is studied

    文摘:研究單機模糊加工時間下確定最遲開工時間的調度問題。
  16. By considering both fuzzy processing time and fuzzy due date as well as specific operator of the workpiece with alternative machines, a fuzzy job shop scheduling problem with alternative machines was studied

    摘要在車間實際加工中，工件的加工時間和交貨期是一個模糊數，而且工件的某道工序有多臺機器可供選擇。
  17. For instance, embranchment working procedure, embranchment point working procedure, working procedure total, working procedure and correspond process time. moreover, this thesis worked out priority area chart. it was based on successively sequence of process manufacture and principle to lessen number of one man working more machine to the best of our abilities

    從預處理過的工序分析表可以找出分支工序、分支點工序、工序總數、各工序及相應工序的加工時間等數據信息，另外根據工序加工的先後順序和盡量減少一人多機的原則，做出了優先權區域圖。
  18. First we give some notations : where r lti : the load of the machine at step t ( i. e., immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; …, jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1, …, pn, there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3. 2. 1 ) the algorithm will schedule jobs in such a way that, at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3. 2. 1 ) step 2 research the following reserved intervals

    需加工n個工件人； … ；人，每個工件是在線到達（ oneb ， olle ）且可打斷的，機器人人的準備時間為az ，怎樣安排加工順序，使工件的最大完工時間（ makespan ）盡可能地小，稱此問題為帶機器準備時間的平行機在線排序問題。它是帶機器準備時間的平行機排序和平行機在線排序問題的綜合和推廣；具有廣泛的應用背景。這里工件在線到達（ onebyone ）指的是工件的情況並不是提前知道的，只有將工件jj人安排完以後我們才能知道工jj的一些情況p工件的加工時間p 。
  19. By normalizing all job sizes and machine cost, we assume that the cost of purchasing one machine is 1. we further know the total size of all jobs in advance

    通過標準化所有工件長度和機器費用，我們可假設購買一臺機器的費用是1 .所討論的半在線模型假設已知所有工件的總加工時間
  20. We are given a sequence of independent jobs with positive sizes, which must be assigned to be processed on machines

    給定一個工件序列，每個工件都有非負的長度即加工時間，並且必須分給機器加工
分享友人
分享到 Line

分享到臉書