Digital Twin-driven machining process for thin-walled part manufacturing

Thin-walled parts are widely used in the aerospace, shipbuilding, and automotive industry, but due to its unique structure and high accuracy requirements, which leads to an increase in scrapped parts, high cost in production, and a more extended period in the trial machining process. However, to adapt to fast production cycles and increase the efficiency of thin-walled parts machining, this paper presents a Digital Twin-driven thin-walled part manufacturing framework to allow the machine operator to manage the product changes, make the start-up phases faster and more accurate. The framework has three parts: preparation, machining, and measurement, driven by Digital Twin technologies in detail. By establishing and updating the workpiece Digital Twin under a different status, various manufacturing information and data can be integrated and available to machine operators and other Digital Twins. It can serve as a guideline for establishing the machine tool and workpiece Digital Twin and integrating them into the machining process. It provides the machine operator opportunities to interact with both the physical manufacturing process and its digital data in real-time. The digital representation of the physical process can support them to manage the trial machining from different aspects. In addition, a demonstrative case study is presented to explain the implementation of this framework in a real manufacturing environment.     

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.     

Real-time integrated production-scheduling and maintenance-planning in a flexible job shop with machine deterioration and condition-based maintenance

The introduction of modern technologies in manufacturing is contributing to the emergence of smart (and data-driven) manufacturing systems, known as Industry 4.0. The benefits of adopting such technologies can be fully utilized by presenting optimization models in every step of the decision-making process. This includes the optimization of maintenance plans and production schedules, which are two essential aspects of any manufacturing process. In this paper, we consider the real-time joint optimization of maintenance planning and production scheduling in smart manufacturing systems. We have considered a flexible job shop production layout and addressed several issues that usually take place in practice. The addressed issues are: new job arrivals, unexpected due date changes, machine degradation, random breakdowns, minimal repairs, and condition-based maintenance (CBM). We have proposed a real-time optimization-based system that utilizes a modified hybrid genetic algorithm, an integrated proactive-reactive optimization model, and hybrid rescheduling policies. A set of modified benchmark problems is used to test the proposed system by comparing its performance to several other optimization algorithms and methods used in practice. The results show the superiority of the proposed system for solving the problem under study. The results also emphasize the importance of the quality of the generated baseline plans (i.e., initial integrated plans), the use of hybrid rescheduling policies, and the importance of rescheduling times (i.e., reaction times) for cost savings.     

Decision-based process planning for wire and arc additively manufactured and machined parts

The conventional manufacturing of aircraft components is based on the machining from bulk material and the buy-to-fly ratio is high. This, in combination with the often low machinability of the materials in use, leads to high manufacturing costs. To reduce the production costs for these components, a process chain was developed, which consists of an additive manufacturing process and a machining process. To fully utilize the process chain’s capabilities, an integrated process planning approach is necessary. As a result, the work sequence can be optimized to achieve the economically most suitable sequence. In this paper, a method for a joint manufacturing cost calculation and subsequent decision-based cost minimization is proposed for the wire and arc additive manufacturing (WAAM) & milling process chain. Furthermore, the parameters’ influence on the results and the magnitude of their influence are determined. These results make it possible to design an economically optimal work sequence and to automate the process planning for this process chain.     

Scalable framework for blockchain-based shared manufacturing

Shared Manufacturing is a new mode of social manufacturing based on the principles of a sharing economy. This paper presents a scalable framework for blockchain-based Shared Manufacturing that preserves the transparency and immutability characteristics of transaction records, which is critical to building trust between entities in blockchain-based systems. We define a blockchain-based protocol for the service execution according to the design principles of the sharing economy. We present a scalable integration of blockchain technology into the concept of Shared Manufacturing by employing cross-chain solutions. We discuss existing cross chain technologies regarding the requirements of Shared Manufacturing and propose hybrid approach. We compare implementations of the proposed framework on two different blockchain networks: Ethereum public network and Xdai sidechain network. We conduct user-oriented test to explore the performance (cost and time) of the implementations in realistic situations in order to justify the use of the sidechain technology. Results indicate that the implementation on the sidechains provides greater scalability than the implementation on the public blockchain network.     

A Polynomial Algorithm for Computing Elementary Siphons in a Class of Petri Nets

A set of elementary siphons plays a key role in the development of deadlock prevention policies for automated manufacturing systems. This paper addresses the computation problem for elementary siphons in a subclass of Petri nets which are basic systems of simple sequential processes with resources (BS³PR) and can model many automated manufacturing systems. An algorithm for enumerating elementary siphons is established by the one‐to‐one relationship between maximal perfect resource‐transition circuits (MPCs) and strict minimal siphons. A set of MPCs is first computed, followed by a set of elementary siphons in a BS³PR. The presented algorithm is proved to have polynomial‐time complexity. An example is used to illustrate the algorithm.     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

模块化企业结构探讨

提出了模块化企业和插件式企业的概念，并对这种企业的组织结构进行了探讨。认为模块化和插件式的企业才能真正快速构成动态联盟，才能产生敏捷制造的制造模式，并对传统的企业如何转化为模块化或插件式的企业进行了分析。     

火车车轮成形新工艺的开发研究

在比较分析技术先进国家的火车车轮成形工艺流程后，采用试验研究和数值模拟相结合方法，研究开发出优化的新工艺。钢坯先在一台水压机上预成形制坯，再在另一台压机上模锻，经轧制扩径后冲孔压弯。这样的生产线效益最好