这里的问题主要是一个布局功能；页面是专为大屏幕设计的，并针对移动设备适当地安排一些屏幕外的控制。
The problem here is mostly a function of the layout; the page is designed for a larger screen and absolutely positions some controls off the screen for a mobile device.
MCS通过设备布局策略(layout policies)解决了这个问题，这个策略管理设备描述并删减其内容以适合不同的屏幕尺寸及设备性能。
MCS solves this problem with device layout policies that manage presentation and tailor content to suit the screen sizes and capabilities of various devices.
介绍了树脂砂车间工艺设计中选择原材料、设备和工艺布局时应注意的问题，并提出了一些合理化建议。
Problems of selection of raw materials and layout of equipment and process bewared in design of resin-bonded sand shops are introduced and rationalization proposal set forth.
对于车间制造技术，论文使用群智能算法求解车间的设备布局优化问题。
Regarding the workshop technique of manufacture, the swarm intelligence algorithms are used to solve the facility layout optimization problem.
在此基础之上，进一步对WGTJ生产流程中的工厂布局、物流、设备工装、作业者与作业方法、零件即材料进行了分析，并诊断出相应的问题点。
Based on it, further analyses the shop layout, logistic, equipment and tooling, operation, parts and material of WGTJ, and diagnoses the problems and root causes.
本文针对制造系统布局问题研究了制造单元设备布局方法和布局方案的可视化及运行仿真技术。
The researches in this thesis are facility layout, visualization and process simulation of manufacturing Cell according to the layout problem of manufacturing system.
制造系统的设备布局与生产率和生产成本密切相关，布局设计是制造系统设计者面临的关键问题之一。
The facility layout of manufacturing system is related closely with the production rate and cost, so the layout design is one of the key problems with which the designers must confront.
多阶段设备布局下的总成本包括设备拆装成本、物料搬运成本以及区域利用成本，问题的目标是最小化总成本。
The total cost under multi-stage facility layout contains the costs of facility re-location, material handling and area utilization, and the objective is to minimize the total cost.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
应用推荐