Oscillator analogy for modelling the manufacturing systems dynamics

The purpose of this paper is to present an approach of modelling and analysis of the dynamic behaviour of manufacturing systems. The manufacturing system is considered to be responding to an excitation, namely a demand that varies over time, by producing a number of parts over time. This resembles a mechanical system that displaces its mass responding to a varying input force. Based on this analogy, this paper establishes a manufacturing system's modelling method. A system identification technique is used for deriving inertia, damping and stiffness from the manufacturing system's response to different excitations. Based on these attributes, the response of a manufacturing system to any given input can be estimated. Furthermore, a definition for assessing manufacturing flexibility, based on this approach, is being discussed.     

Virtual fusion: a hybrid environment for improved commissioning in manufacturing systems

Efficiency and quality are major factors contributing to profits in manufacturing systems. Production downtime occurs during commissioning of a new system, adoption of new processes, system faults, or (un)planned maintenance; all of which result in reduced production and profit loss. Current techniques for evaluating change to a manufacturing system rely on simulation and modeling to verify processes, but ignore the physical interactions of the work parts on the system. Implementation techniques to evaluate commissioning focus on identifying issues with the cyber interfaces, ignoring the physical interfaces. To validate the cyber and physical interfaces simultaneously, physical work are sent through the system, resulting in significant costs from scrapped work parts and loss of production time. This research proposes a virtual fusion environment where the physical interfaces between a virtual work part and a manufacturing system can be investigated in real-time, on the physical system, without the expenses associated with physical work parts. The virtual environment includes a virtual fusion filter to monitor discrepancies between the physical and virtual systems, and generate a hybrid virtual-physical input signal to the system level controller for virtualisation of a work part onto a physical system. Experimental demonstrations validate the feasibility of the proposed approach.     

Analysis of sequential failures for assessment of reliability and safety of manufacturing systems

Assessment of reliability and safety of a manufacturing system with sequential failures is an important issue in industry, since the reliability and safety of the system depend not only on all failed states of system components, but also on the sequence of occurrences of those failures. Methods that are currently available in sequential failure analysis always start with given sequences of the failures in the system, which is not the case in real life situations; therefore, the sequences of the failures should be identified and the probability of their occurrence should be determined. In this paper, we represent a methodology that can be used for identifying the failure sequences and assessing the probability of their occurrence in a manufacturing system. The method employs Petri net modeling and reachability trees constructed based on the Petri nets. The methodology is demonstrated on an example of an automated machining and assembly system.     

Reconfiguration: a key to handle exceptions and performance deteriorations in manufacturing operations

During a manufacturing operation, exceptions may occur dynamically and unpredictably. Their occurrence may lead to the degradation of system performance or, in the worst case scenario may interrupt the production process by causing errors in the schedule plan. This paper classifies three families of exceptions: (1) out-of-order events such as machine breakdowns, (2) operational out-of-ordinary events such as rush orders and (3) deteriorations of manufacturing resource performance such as reductions of machines’ utilization. In all cases, in order to maintain an adequate level of system performance, it is necessary to detect exceptions, to diagnose them quickly and to recover them by taking corrective actions to avoid fault propagations. Decisions concerning how to deal with exceptions, i.e. which strategy to implement, depend on the manufacturing environment (dedicated line, flexible system, reconfigurable system or a mix of them) and the advantages arising from using a certain exception handling policy vary from one production system to another. The activity of reconfiguring manufacturing resources has been demonstrated to be a powerful operation strategy to handle machine breakdowns. This paper extends the concept of ‘reconfiguration for exception handling’ to other families of exceptions and proposes reconfiguration for their recovery. The reconfiguration process is handled by an agent-based control system that implements four negotiation processes among manufacturing resource agents.     

An aggregation method of Markov graphs for the reliability analysis of hybrid systems

To meet always increasing safety requirements in car industry, design and safety assessment methods are developed in order to fit the complexity of new embedded mecatronic systems. Hybrid (discrete/continuous) and dynamic features, specific to these systems, require choosing a suitable formalism. These features should also be considered in safety studies made all through the system design. The aim of this paper is to propose a quantitative analysis method based on the construction of an aggregated Markov graph, which allows a limitation of the combinatorial expansion. This graph is directly deducted from the Petri net modelling of the system. It is composed by a set of functional modes and a set of transitions to which statistical information regarding the system dynamics has been added.     

The tool transporter movements problem in flexible manufacturing systems

We consider a job sequencing and tool transporter movements problem on a single flexible machine with limited tool magazine capacity. A tool transporter having limited capacity is used in transporting the tools between the machine and tool crib area. Our aim is to minimize the number of the tool transporter movements. We present several lower and upper bounds, propose a Branch-and-Bound algorithm and a Beam Search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for medium-sized instances with 25 jobs and 25 tools. For large-sized problem instances, Beam Search provides high quality solutions very quickly. Finally, we address the problem of minimizing the total flow time.     

Scheduling of deadlock and failure-prone automated manufacturing systems via hybrid heuristic search

This work focuses on the scheduling problem of deadlock and failure-prone automated manufacturing systems, and presents a new scheduling method by combining a robust supervisory control policy and hybrid heuristic search. It aims to minimise makespan, i.e. the completion time of the last part. Based on the extended reach ability graph of the system, it establishes a new heuristic function and two dispatching rules to guide the search process for a schedule. By embedding a robust supervisory control policy into the search process, it develops a polynomial robust dynamic window search algorithm. Failure and repair events of unreliable resources may occur during the execution of a schedule obtained by the proposed algorithm and may make the schedule infeasible. To reduce the influence caused by them and ensure all parts to be finished, this work proposes two event-driven strategies. The first one suspends the execution of the parts requiring failed resources and those to be started until all failed resources are repaired and permits only those parts that have already been processed on working machines to be completed. The second one invokes the proposed algorithm to obtain a new schedule at the vertex generated after a resource failure or repair event and executes the new schedule. Both strategies are effective while the latter performs better at the expense of more computation.     

Machine cell formation for production management in cellular manufacturing systems

The formation of machine-part families is an important task in the design of cellular manufacturing systems. Manufacturing cell grouping has the effect of reducing material handing cost and work in process. Among the many methods utilized in machine cells formation, the similarity coefficient method is most widely used. Production sequence and product volumes, if incorporated properly in determining the machine cells, can enhance the quality of solutions and reduce the number of intercellular movements. Measures for cell formation based on operations sequence utilizing ordinal production data are few and have many limitations, such as counting the number of the trips for each individual part instead of counting the weights of the batches. A new ordinal production data similarity coefficient based on the sequence of operations and the batch size of the parts is introduced. Furthermore, a new clustering algorithm for machine cell formation is proposed. The new similarity measure showed more sensitivity to the intercellular movements and the clustering algorithm showed better machine grouping.     

Integrated design approach for virtual production line-based reconfigurable manufacturing systems

Reconfigurable manufacturing systems (RMSs) have been recognized as a new manufacturing paradigm. In light of their enhanced flexibility and responsiveness, RMSs are considered to be mostly applicable to the very dynamic and unpredictable marketplaces of the near future. However, systematic approaches to the design and ramp-up of an RMS have not been well addressed. This paper presents a virtual production line-based (VPL) approach to the design and operation of a reconfigurable manufacturing system. Shop floor attributed finite-capacity automaton and VPL attributed finite-capacity automaton are proposed for modelling the control of an RMS, which leads to ease of control software development. Algorithms for balancing VPLs to maximize the productivity of an RMS are discussed. The results of simulation runs of the proposed methodology and algorithms applied to simplified back-end semiconductor manufacturing are provided.     

制造质量记录信息管理系统的总体设计与开发

本文首先论述了质量记录在计算机辅助质量管理（ＣＡＱＭＳ）中的作用及地位，随后阐述制造质量记录信息管理系统的总体设计方案，以上工作在计算机集成制造系统（ＣＩＭＳ）应用中将得到体现。     

A genetic scheduling methodology for virtual cellular manufacturing systems: an industrial application

Effective solutions to the cell formation and the production scheduling problems are vital in the design of virtual cellular manufacturing systems (VCMSs). This paper presents a new mathematical model and a scheduling algorithm based on the techniques of genetic algorithms for solving such problems. The objectives are: (1) to minimize the total materials and components travelling distance incurred in manufacturing the products, and (2) to minimize the sum of the tardiness of all products. The proposed algorithm differs from the canonical genetic algorithms in that the populations of candidate solutions consist of individuals of different age groups, and that each individual's birth and survival rates are governed by predefined aging patterns. The condition governing the birth and survival rates is developed to ensure a stable search process. In addition, Markov Chain analysis is used to investigate the convergence properties of the genetic search process theoretically. The results obtained indicate that if the individual representing the best candidate solution obtained is maintained throughout the search process, the genetic search process converges to the global optimal solution exponentially.

The proposed methodology is applied to design the manufacturing system of a company in China producing component parts for internal combustion engines. The performance of the proposed age-based genetic algorithm is compared with that of the conventional genetic algorithm based on this industrial case. The results show that the methodology proposed in this paper provides a simple, effective and efficient method for solving the manufacturing cell formation and production scheduling problems for VCMSs.     

Dynamic restructuring process for self-reconfiguration in the fractal manufacturing system

To meet the rapidly changing customer needs in the manufacturing environment, future manufacturing systems must be dynamically and flexibly reconfigured. The fractal manufacturing system (FrMS) is one of the new manufacturing paradigms that can meet such requirements. The basic component of the FrMS is referred to as a fractal. Consisting of self-similar agents, each fractal autonomously cooperates and negotiates with others to coordinate its tasks. Dynamic restructuring process (DRP) supports reorganization of the system configurations so that the FrMS can be adapted to dynamically changing environments. Although traditional approaches have endeavoured to demonstrate reconfigurability of a manufacturing system, they are not accurate enough to meet the requirements of circumstances such as high-level autonomy in reconfiguring the system architecture. In this paper, therefore, the DRP, which embodies self-reconfigurability of a system, is proposed focusing on the FrMS. To check the effectiveness of the DRP, we have developed the FrMS test bed and conducted the experimentation on the DRP. A simulation study has been conducted to show the effectiveness of the DRP under an illustrative situation.     

Self-adaptive dynamic scheduling of virtual production systems

To enhance the agility of virtual production systems (VPSs) under today's dynamic and changing manufacturing environment, a self-adaptive dynamic scheduling method based on event-driven is proposed for VPSs in this paper. This method is composed of the mechanisms and algorithm of self-adaptive dynamic scheduling. In the mechanisms, the dynamic events faced by VPSs are determined through users’ inputs or supervisory controllers’ detections, the local effects made on the schedule are analysed according to the dynamic events, and the self-adaptive measures and rules are specified correspondingly. To implement the dynamic scheduling of VPSs under the guidance of self-adaptive rules, a modified heuristic rescheduling algorithm is proposed for affected operations. A case study illustrates that the proposed method can well accomplish the dynamic scheduling of VPSs in a self-adaptive manner.     

A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems

Facility layout design problems in flexible manufacturing systems (FMS) differ from traditional facility design problems and are more difficult to solve because there are more constraints that must be considered (i.e., cell shape, cell orientation, pick-up and drop-off point positions). The focus of this paper is on the closed loop type layout, which is based on a predetermined layout pattern. This layout pattern is commonly found in manufacturing settings since it requires a simplified material handling system configuration and since it facilitates a modular and expandable layout structure. The open-field type layout problem, where there is no predetermined layout pattern, may potentially have a more efficient configuration, since there are fewer restrictions. However, this problem is more difficult to solve and may result in configurations that are not desirable due to the lack of structure or modularity. The procedure developed in this paper improves the efficiency of the closed loop configuration by changing the rectangular shape of the loop to different sizes. In many cases, the resulting closed loop layout proves to be as efficient as the open field layout. A simulated annealing procedure (SA-CL) is used to search for the configuration that minimizes the total material handling costs. A comparison of the results with existing methods indicates that, based on solution quality and computational time, the SA-CL offers a favourable alternative for efficient layout design.     

A multi-agent framework for capability-based reconfiguration of industrial assembly systems

Rapidly changing market requirements and shorter product lifecycles demand assembly systems that are able to cope with frequently changing resources, resource capabilities and product specifications. This paper presents a multi-agent framework that can adapt an assembly system in order to cope with such changes. The focus of this work is on the ability to plug resources (such as PLCs) into and out of the system, and dynamically aggregate resource capabilities to form more complex ones as resources are plugged in. In addition, an implementation of the framework on an industrial assembly system is discussed, and some insights are provided into some of the key features that product specification languages ought to have to be useful in real world assembly systems, and into the added value of using the proposed framework.     

单用户毫米波大规模MIMO系统的混合预编码方案设计

对MIMO通信系统的数字预编码方法进行了深入分析,指出单用户毫米波大规模MIMO系统和传统全数字预编码方案所用射频(RF)链路数量过大致使系统实现成本大和能量消耗较高,并针对这种情况,提出了一种在系统收发两端分别采用混合预编码器和混合合成器的混合预编码方案。该方案首先通过迭代算法设计模拟预编码矩阵,并且根据信道矩阵与模拟预编码矩阵作用生成的等效信道矩阵设计数字预编码矩阵,然后根据混合预编码器设计混合合成器,从而使系统频谱效率最大化。该方案与传统全数字预编码及现有混合预编码方案的仿真比较结果表明,该方案有效降低了系统实现成本和能量消耗,且性能优于现有的混合预编码方案,与传统全数字预编码方案相比,性能非常接近。     

Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. The machines have limited time and tool magazine capacities and the available tools are limited. Our objective is to maximise total weight of assigned operations. We develop a branch and bound algorithm that finds the optimal solutions and a beam search algorithm that finds high quality solutions in polynomial time.     

Markovian models for deadlock analysis in automated manufacturing systems

Deadlocks constitute a major issue in the desing and operation of discrete event systems. In automated manufacturing systems, deadlocks assume even greater importance in view of the automated operation. In this paper, we show that Markov chains with absorbing states provide a natural model of manufacturing systems with deadlocks. With illustrative examples, we show that performance indices such as mean time to deadlock and mean number of finished parts before deadlock can be efficiently computed in the modelling framework of Markov chains with absorbing states. We also show that the distribution of time to deadlock can be computed by conducting a transient analysis of the Markov chain model.     

Integrated analytical models for flexible manufacturing systems

Product form queueing networks (pfqn) and generalized stochastic Petri nets (gspn) have emerged as the principal performance modelling tools for flexible manufacturing systems (fms). In this paper, we present integratedpfqn-gspn models, which combine the computational efficiency ofpfqn and representational power ofgspn by employing the principle of flow-equivalence. We show thatfms that include nonproduct form characteristics such as dynamic routing and synchronization can be evaluated efficiently and accurately using the integrated models.     

A backward algorithm for computing optimal controls for single-stage hybrid manufacturing systems

This paper concerns optimal control problems in single-stage manufacturing systems. The control variables comprise parameters of the jobs' processing times, and the cost functional involves measures of both jobs' due dates and products' physical characteristics. The system is configured for processing a finite number of jobs in a given order, and it is modelled as a hybrid dynamical system cast in a deterministic setup. The paper identifies a necessary and sufficient optimality condition having an intuitive geometric appeal, and it develops an efficient, low-complexity algorithm for computing the optimal controls. Numerical experiments testify to the efficacy of the proposed algorithm.