工艺图 meaning in Chinese
artwork
flow chart
flow sheet
process chart
process drawing
Examples
- 3 . thousands of techniques lib : logging in and opening the techniques graphics , lib managemen
三上千个工艺图库：登录和打开工艺图形，图形库管理。 - The functions of the system involve process parameters design , sand core design , riser design , gating system design , pattern plate design , core box design , and creation of two - dimensional drawings and charts
该系统针对汽车铸件，其功能包括工艺参数设计、砂芯设计、冒口设计、浇注系统设计、模板设计、芯盒设计以及二维工艺图、卡的生成。 - A new method which carried out the self - assembly of drug - loading nanoparticles and stent by comprehensively applying the micro - forces such as dielectrophoretic force , capillary force , and hydrophobic force is put forward , and the self - assembly process schematic drawing is given
同时提出综合应用介电泳动、毛细作用和组件的疏水性等微观作用力，实现载药纳米颗粒与血管支架自组装的方法，并给出了自组装的实现工艺图。 - Considering the np - complete problem , how to get the approximate optimized scheme of job - shop scheduling , and aimed at improving the efficiency of products and taking good advantage of concurrence , asynchronism , distributing and juxtaposition in multi - products and devices processing , we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop , that is the working procedures are divided into two types , then the bf and the ff methods about memory scheduling in os are applied , therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling . namely , the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it . the results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results
针对job - shop调度问题求最优解算法这一npc问题，本文以充分发挥多产品、多设备加工所具有并发性、异步性、分布性和并行性的加工优势，从而提高产品的加工效率为目标，对job - shop调度问题的工艺图进行适当分解，使工序在一定时间段或是为具有唯一紧前、紧后相关工序或是为独立工序，即将工序分两类，再结合操作系统中内存调度的最佳适应( bf )调度方法和首次适应( ff )调度方法的先进思想，通过分析提出了一种解决一般job - shop调度问题的全新近优解方案：在考虑关键设备上工序尽量紧凑的前提下，将工序分类、对这两类工序分批采用拟关键路径法( acpm )和最佳适应调度方法( bfsm )安排工序的算法，用实例加以验证，并给出结果甘特图。 - When the approximate optimized scheme of common job - shop scheduling discussed in the paper is applied to the practice , it could make some parts of working procedures of processing product be the tail end of the tree that working procedures of this product makes , that is , these parts of working procedures still makes a tree like the whole process . during the processing of one product , if another product needed to be processed , we could process it with the mentioned method solving static job - shop scheduling . therefore , a new method to solve dynamic job - shop scheduling is put forward and validated by practice
同时采用本文提出的解决一般job - shop调度问题的全新近优解方案，可以使得产品所加工的部分工序是产品的加工工艺图（加工树）某些枝杈的末端，即产品未加工的剩余部分工序的加工工艺图仍然是一棵加工树，这样对于正在加工的产品，如果有另外需要加工的产品，可一并按上述解决静态job - shop调度问题的方法处理，于是本文又提出了一个解决动态job - shop调度问题的新方法，并通过实例加以说明。