D-side: A facility and workforce planning group multi-criteria decision support system for Johnson Space Center

“To understand and protect our home planet, to explore the universe and search for life, and to inspire the next generation of explorers” is NASA's mission. The Systems Management Office at Johnson Space Center (JSC) is searching for methods to effectively manage the Center's resources to meet NASA's mission. D-Side is a group multi-criteria decision support system (GMDSS) developed to support facility decisions at JSC. D-Side uses a series of sequential and structured processes to plot facilities in a three-dimensional (3-D) graph on the basis of each facility's alignment with NASA's mission and goals, the extent to which other facilities are dependent on the facility, and the dollar value of capital investments that have been postponed at the facility relative to the facility's replacement value. A similarity factor rank orders facilities based on their Euclidean distance from Ideal and Nadir points. These similarity factors are then used to allocate capital improvement resources across facilities. We also present a parallel model that can be used to support decisions concerning allocation of human resources investments across workforce units. Finally, we present results from a pilot study where 12 experienced facility managers from NASA used D-Side and the organization's current approach to rank order and allocate funds for capital improvement across 20 facilities. Users evaluated D-Side favorably in terms of ease of use, the quality of the decision-making process, decision quality, and overall value-added. Their evaluations of D-Side were significantly more favorable than their evaluations of the current approach.     

A genetic algorithm for the optimisation of assembly sequences

This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product.     

电子商务环境下企业资源计划(ERP)的新进展

分析了在电子商务环境下企业资源计划 (ERP)需求的新特点 ,并结合ERP发展和实际应用中存在的问题 ,论述了ERP与电子商务集成化的发展方向 ,提出了企业关系管理 (ERM )的基本框架和建立商业网络 (BN)的必要性。同时 ,还论述了ERP系统在网络化、模块化和智能化的发展方向和最新进展。     

基于专家系统的机器人高层规划

本文介绍一个基于专家系统的机器人高层规划系统,阐述几个潜在应用子系统,并应用专家系统方法进行多机器人协调避碰运动规划。本系统具有良好的规划性能。     

Using the analytic network process (ANP) in a SWOT analysis - A case study for a textile firm

Strengths, Weaknesses, Opportunities and Threats (SWOT) analysis does not provide an analytical means to determine the importance of the identified factors or the ability to assess decision alternatives according to these factors. Although the analysis successfully pinpoints the factors, individual factors are usually described briefly and very generally. For this reason, SWOT analysis possesses deficiencies in the measurement and evaluation steps. Although the analytic hierarchy process (AHP) technique removes these deficiencies, it does not allow for measurement of the possible dependencies among the factors. The AHP method assumes that the factors presented in the hierarchical structure are independent; however, this assumption may be inappropriate in light of certain internal and external environmental effects. Therefore, it is necessary to employ a form of SWOT analysis that measures and takes into account the possible dependency among the factors. This paper demonstrates a process for quantitative SWOT analysis that can be performed even when there is dependence among strategic factors. The proposed algorithm uses the analytic network process (ANP), which allows measurement of the dependency among the strategic factors, as well as AHP, which is based on the independence between the factors. Dependency among the SWOT factors is observed to effect the strategic and sub-factor weights, as well as to change the strategy priorities.     

Service life planning and performance requirements

Service life planning comprises a model for the determination of a reasonable expected service life for buildings and components, and it establishes a routine for the assessment of design alternatives. A design option is considered reasonable when it meets or exceeds performance requirements over time that have been drawn up specifically for the specific project. Due to this assessment reference, there is a very evident link to the concept of performance-based building. Any stakeholder involved in the value chain or in the design process of the building, as well as regulators and building users, can express performance requirements. Identified requirements, both in relevance and in quality, will vary with the stakeholder and his/her perspective of interest. As building sector manufacturers develop most products with reference to standards rather than with reference to specific requirements, there is no direct link from user requirements to the product design. Instead, the building designer has the responsibility to ensure performance requirements are met by the performance of products integrated into the design. As these design decisions also have to be made at the material and component level, a performance-based building would benefit from an established rationale that enables the communication of performance requirements across the relevant system levels in the relevant design processes. A path for the connection of the established concepts of service life planning and performance-based building is presented. The aim is to identify key elements that need to be developed for the successful linkage of performance-based building with service life planning.     

堆底熔穿事故的场外后果及其对策

在压水堆核电站应急计划和应急响应中，堆底熔穿事故占有重要位置。本文用法国核电厂事故源项Ｓ３（对应于堆底熔穿事故）计算了在典型气象条件下的场外放射学的后果，根据一般防护决策原则和我国颁布的干预水平，提出了保护公众的应急防护措施的建议。     

PTN网络的二次断纤链路规划算法

在PTN（PacketTransportNetwork）网络规划建设中,需要对光纤链路留出备份带宽,以保证部分光纤断开时,受影响业务有足够的容量进行路由重组。这也是提高网络生存性的有效方法之一。文中首先遍历网络双链路的失效状态,然后断开网络中任意两条链路,通过逐次增加链路容量来保证失效业务能够重组路由;最后提出二次断纤链路容量规划算法并进行试验仿真。结果表明,该算法在节约网络带宽、降低建造成本以及故障容错方面有着良好性能,能够很好应用于传送网络的链路规划中。     

考虑多样化需求的诊疗设备维护和患者调度联合优化研究

针对诊疗设备维护和住院患者候诊难以有效协调的问题,建立了联合优化模型。首先,假设设备具有离散的劣化状态,将设备的劣化过程建模为连续时间马尔可夫链;其次,考虑到患者对诊疗设备的不同功能频率需求,以及不同劣化状态对患者治疗时间、费用的影响,以患者就诊顺序、检查策略、修复策略为决策变量建立了设备维护和患者调度模型;最后,采用改进后的非支配排序遗传算法对多目标问题进行了求解。实验结果验证了设备维护与患者调度联合优化模型的有效性。改进后的算法提高了整体和局部的搜索能力,且具有鲁棒性。     

Mathematical model and discrete artificial Bee Colony algorithm for distributed integrated process planning and scheduling

With the development of the globalization of economy and manufacturing industry, distributed manufacturing mode has become a hot topic in current production research. In the context of distributed manufacturing, one job has different process routes in different workshops because of heterogeneous manufacturing resources and manufacturing environments in each factory. Considering the heterogeneous process planning problems and shop scheduling problems simultaneously can take advantage of the characteristics of distributed factories to finish the processing task well. Thus, a novel network-based mixed-integer linear programming (MILP) model is established for distributed integrated process planning and scheduling problem (DIPPS). The paper designs a new encoding method based on the process network and its OR-nodes, and then proposes a discrete artificial bee colony algorithm (DABC) to solve the DIPPS problem. The proposed DABC can guarantee the feasibility of individuals via specially-designed mapping and switching operations, so that the process precedence constraints contained by the network graph can be satisfied in the entire procedure of the DABC algorithm. Finally, the proposed MILP model is verified and the proposed DABC is tested through some open benchmarks. By comparing with other powerful reported algorithms and obtaining new better solutions, the experiment results prove the effectiveness of the proposed model and DABC algorithm successfully.