Energy-oriented bi-objective optimisation for a multi-module reconfigurable manufacturing system

This paper investigates a multi-module reconfigurable manufacturing system for multi-product manufacturing. The system consists of a rotary table and multiple machining modules (turrets and spindles). The production plan of the system is divided into the system design phase and the manufacturing phase, where the installation cost and the energy consumption cost correspond to the two phases, respectively. A mixed-integer programming model for a more general problem is presented. The objectives are to minimise the total cost and minimise the cycle time simultaneously. To solve the optimisation problem, the ε-constraint method is adopted to obtain the Pareto front for small size problems. Since the ε-constraint method is time consuming when problem size increases, we develop a multi-objective simulated annealing algorithm for practical size problems. To demonstrate the efficiency of the proposed algorithm, we compare it with a classic non-dominated sorting genetic algorithm. Experimental results demonstrate the efficiency of the multi-objective simulated annealing algorithm in terms of solution quality and computation time.     

Cell design and multi-period machine loading in cellular reconfigurable manufacturing systems with alternative routing

This paper deals with the design and loading of Cellular Reconfigurable Manufacturing Systems in the presence of alternative routing and multiple time periods. These systems consist of multiple reconfigurable machining cells, each of which has Reconfigurable Machine Tools and Computer Numerical Control (CNC) machines. Each reconfigurable machine has a library of feasible auxiliary machine modules for achieving particular operational capabilities, while each CNC machine has an automatic tool changer and a tool magazine of a limited capacity. The proposed approach consists of two phases: the machine cell design phase which involves the grouping of machines into machine cells, and the cell loading phase that determines the routing mix and the tool and module allocation. In this paper, the cell design problem is modelled as an Integer Linear Programming formulation, considering the multiple process plans of each part type as if they were separate part types. Once the manufacturing cells are formed, a Mixed Integer Linear Programming model is developed for the cell loading problem, considering multi-period demands for the part types, and minimising transportation and holding costs while keeping the machine and cell utilisations in each period, and the system utilisation across periods, approximately balanced. An illustrative problem and experimental results are presented.     

Multi-objective multi-unit process plan generation in a reconfigurable manufacturing environment: a comparative study of three hybrid metaheuristics

Low costs, high reactivity and high quality products are necessary criteria for industries to achieve competitiveness in nowadays market. In this context, reconfigurable manufacturing systems (RMSs) have emerged to fulfil these requirements. RMS is one of the latest manufacturing paradigms, where machines components, software or material handling units can be added, removed, modified or interchanged as needed and when imposed by the necessity to react and respond rapidly and cost-effectively to changing. This research work addresses the multi-objective single-product multi-unit process plan generation problem in a reconfigurable manufacturing environment where three hybrid heuristics are proposed and compared namely: repetitive single-unit process plan heuristic (RSUPP), iterated local search on single-unit process plans heuristic (LSSUPP) and archive-based iterated local search heuristic (ABILS). Single-unit process plans are generated using the adapted non-dominated sorting genetic algorithm (NSGA-II). Moreover, in addition to the minimisation of the classical total production cost and the total completion time, the minimisation of the maximum machines exploitation time is considered as a novel optimisation criterion, in order to have high quality products. To illustrate the applicability of the three approaches, examples are presented and the obtained numerical results are analysed.     

Recent advances in research on reconfigurable machine tools: a literature review

A recent trend in research on reconfigurable manufacturing systems is the development of reconfigurable machine tools (RMTs). A RMT can be used as a group of machines through change of its configuration to satisfy different manufacturing requirements. A literature review is provided in this paper to demonstrate the state-of-the-art advances and challenges on research and development of RMTs from the perspectives of architecture design, configuration design and optimisation, and system integration and control. In architecture design, semi-open and open architectures based on modular design approach are often selected to allow different modules of the machine to be added and removed. In configuration design and optimisation, operations of reconfiguration processes are analysed and optimised to achieve variety of configurations with the minimum reconfiguration effort. In system integration and control, transfers of motion, energy and data among different modules of the RMT are carried out. The challenges in research on RMTs are also discussed.     

Configuration design of scalable reconfigurable manufacturing systems for part family

Intense global competition, dynamic product variations, and rapid technological developments force manufacturing systems to adapt and respond quickly to various changes in the market. Such responsiveness could be achieved through new paradigms such as Reconfigurable manufacturing systems (RMS). In this paper, the problem of configuration design for a scalable reconfigurable RMS that produces different products of a part family is addressed. In order to handle demand fluctuations of products throughout their lifecycles with minimum cost, RMS configurations must change as well. Two different approaches are developed for addressing the system configuration design in different periods. Both approaches make use of modular reconfigurable machine tools (RMTs), and adjust the production capacity of the system, with minimum cost, by adding/removing modules to/from specific RMTs. In the first approach, each production period is designed separately, while in the second approach, future information of products’ demands in all production periods is available in the beginning of system configuration design. Two new mixed integer linear programming (MILP) and integer linear programming (ILP) formulations are presented in the first and the second approaches respectively. The results of these approaches are compared with respect to many different aspects, such as total system design costs, unused capacity, and total number of reconfigurations. Analyses of the results show the superiority of both approaches in terms of exploitation and reconfiguration cost.     

Flexibility-based multi-objective approach for machines selection in reconfigurable manufacturing system (RMS) design under unavailability constraints

The reconfigurable manufacturing system (RMS) is a recent manufacturing paradigm driven by the high responsiveness and performance efficiencies. In such system, machines, material handling units or machines components can be added, modified, removed or interchanged as needed. Hence, the design of RMS is based on reconfigurable machines capabilities and product specification. This paper addresses the problem of machines selections for RMS design under unavailability constraints and aims to develop an approach to ensure the best process plan according to the customised flexibility required to produce all parts of a given product. More specifically, we develop a flexibility-based multi-objective approach using an adapted version of the well-known non-dominated sorting genetic algorithm to select adequate machines from a set of candidate (potential) ones, in order to ensure the best responsiveness of the designed system in case of unavailability of one of the selected machines. The responsiveness is based on the flexibility of the designed system and a generated process plan, which guarantees the management of machines unavailability. It is defined as the ability and the capacity to adapt the process plan in response to machines unavailability. Two objectives are considered, respectively, the maximisation of the flexibility index of the system and the minimisation of the total completion time. To choose the best solution in the Pareto front, a multi-objective decision-making method called technique for order of preference by similarity to ideal solution is used. To demonstrate the applicability of the proposed approach, a simple example is presented and the numerical results are analysed.     

A reactive GRASP and Path Relinking for balancing reconfigurable transfer lines

A line balancing problem for reconfigurable transfer lines with sequence-dependent setup times and parallel machines was studied. These lines are paced and serial, i.e. a part to be machined passes through a sequence of stations. Stations are composed of CNC (Computer Numerical Control) machines. At least one CNC machine is installed at each station. These CNC machines are mono-spindle head machines, hence setup times between operations have to be taken into account. The origins of setup times are various, for example, the necessity to rotate the part, change and displace the tool, etc. Because of setup times, the station workload depends on the sequence in which the operations are assigned to the station. In addition, accessibility constraints have to be considered. The objective consists of assigning a given set of operations as well as machines to a sequence of workstations in order to minimise the total cost of the line. Keeping in mind the industrial importance of this problem and the lack of available methods in the literature tackling it efficiently, we propose a new heuristic based on GRASP combined with Path Relinking. A MIP approach is used to select the sequences of operations on workstations. Numerical experiments are presented and show that the proposed heuristic can provide good solutions even for large-sized instances while requiring a computational time that is fully compatible with a practical application. An industrial case study is also described.     

Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA

To facilitate the configuration selection of reconfigurable manufacturing systems (RMS) at the beginning of every demand period, it needs to generate K (predefined number) best configurations as candidates. This paper presents a GA-based approach for optimising multi-part flow-line (MPFL) configurations of RMS for a part family. The parameters of the MPFL configuration comprise the number of workstations, the number of paralleling machines and machine type as well as assigned operation setups (OSs) for each workstation. Input requirements include an operation precedence graph for each part, relationships between operations and OSs as well as machine options for each OS. The objective is to minimise the capital cost of MPFL configurations. A 0-1 nonlinear programming model is developed to handle sharing machine utilisation over consecutive OSs for each part which is ignored in the existing approach. Then a novel GA-based approach is proposed to identify K economical solutions within a refined solution space comprising the optimal configurations associated with all feasible OS assignments. A case study shows that the best solution found by GA is better than the optimum obtained by the existing approach. The solution comparisons between the proposed GA and a particle swarm optimisation algorithm further illustrate the effectiveness and efficiency of the proposed GA approach.     

Configuration design in scalable reconfigurable manufacturing systems (RMS); a case of single-product flow line (SPFL)

The dynamic nature of today’s manufacturing industry, which is caused by the intense global competition and constant technological advancements, requires systems that are highly adaptive and responsive to demand fluctuations. Reconfigurable manufacturing systems (RMS) enable such responsiveness through their main characteristics. This paper addresses the problem of RMS configuration design, where the demand of a single product varies throughout its production life cycle, and the system configuration must change accordingly to satisfy the required demand with minimum cost. A two-phased method is developed to handle the primary system configuration design and the necessary system reconfigurations according to demand rate changes. This method takes advantage of Reconfigurable Machine Tools in RMS. In fact, by adding/removing modules to/from a specific modular reconfigurable machine, its production capability could be increased, with lower cost. A novel mixed integer linear programming formulation is presented in the second phase of the method to optimise the process of selecting the best possible transformation for the existing machine configurations. Two different cases are designed and solved by implementing the established method. The results of these cases in terms of capital cost, capacity expansion cost, unused capacity and number of transformations, are compared with two hypothetical scenarios. Analyses of the obtained results indicate the efficiency of the proposed approach and offer a promising outlook for further research.     

A new heuristic for integrated process planning and scheduling in reconfigurable manufacturing systems

Integrated process planning and scheduling (IPPS) is a manufacturing strategy that considers process planning and scheduling as an integrated function rather than two separated functions performed sequentially. In this paper, we propose a new heuristic to IPPS problem for reconfigurable manufacturing systems (RMS). An RMS consists mainly of reconfigurable machine tools (RMTs), each with multiple configurations, and can perform different operations with different capacities. The proposed heuristic takes into account the multi-configuration nature of machines to integrate both process planning and scheduling. To illustrate the applicability and the efficiency of the proposed heuristic, a numerical example is presented where the heuristic is compared to a classical sequential process planning and scheduling strategy using a discrete-event simulation framework. The results show an advantage of the proposed heuristic over the sequential process planning and scheduling strategy.     

Timed event graph-based cyclic reconfigurable flow shop modelling and optimization

The manufacturing process of a part involves sequential steps and each step could be viewed as the part being manufactured by a process module with some specific function. The module must be placed on a machine and connected to the machine via standard interfaces. The machine considered here is a carrier or general platform that can hold one or several different modules simultaneously. Based on the idea that modules are independent of machines and different combinations of modules and machines result in different configurations, the cyclic reconfigurable flow shop is proposed for the new manufacturing paradigm—Reconfigurable Manufacturing System (RMS). The cyclic reconfigurable flow shop can be modelled as a timed event graph. Different cases of cyclic reconfigurable flow shops are discussed and the optimal configuration can be obtained by solving the corresponding mixed-integer program derived from the timed event graph model.     

Design of delayed reconfigurable manufacturing system based on part family grouping and machine selection

To improve the convertibility of reconfigurable manufacturing system (RMS), the concept of delayed reconfigurable manufacturing system (D-RMS) was proposed. RMS and D-RMS are both constructed around part family. However, D-RMS may suffer from ultra-long system problem with unacceptable idle machines using generic RMS part families. Besides, considering the complex basic system structure of D-RMS, machine selection of D-RMS should be addressed, including dedicated machine, flexible machine, and reconfigurable machine. Therefore, a system design method for D-RMS based on part family grouping and machine selection is proposed. Firstly, a part family grouping method is proposed for D-RMS that groups the parts with more former common operations into the same part family. The concept of longest relative position common operation subsequence (LPCS) is proposed. The similarity coefficient among the parts is calculated based on LPCS. The reciprocal value of the operation position of LPCS is adopted as the characteristic value. The average linkage clustering (ALC) algorithm is used to cluster the parts. Secondly, a machine selection method is proposed to complete the system design of D-RMS, including machine selection rules and the dividing point decision model. Finally, a case study is given to implement and verify the proposed system design method for D-RMS. The results show that the proposed system design method is effective, which can group parts with more former common operations into the same part family and select appropriate machine types.     

Decision support for design of reconfigurable rotary machining systems for family part production

To remain competitive in currently unpredictable markets, the enterprises must adapt their manufacturing systems to frequent market changes and high product variety. Reconfigurable manufacturing systems (RMSs) promise to offer a rapid and cost-effective response to production fluctuations under the condition that their configuration is attentively studied and optimised. This paper presents a decision support tool for designing reconfigurable machining systems to be used for family part production. The objective is to elaborate a cost-effective solution for production of several part families. This design issue is modelled as a combinatorial optimisation problem. An illustrative example and computational experiments are discussed to reveal the application of the proposed methodology. Insight gained would be useful to the decision-makers managing the configuration of manufacturing systems for diversified products.     

新型可重组模块化并联微动机器人研究

针对国内各种结构并联微动机器人结构复杂、不易标定等问题,提出了一类新型的结构解耦可重组模块化并联微动机器人.根据任务要求,利用并联微动机器人构型原理,选择不同的运动支链模块可构建3-6DOFs（自由度）并联微动机器人.其运动支链模块是由简单的弹性运动副单元组成,采用一体化设计,从而保证微动机器人的精度要求,解决了并联微动机器人采用完全装配式装配误差大、整体加工式工艺性较差的技术问题.     

GA-based adaptive setup planning toward process planning and scheduling integration

Setup planning of a part for more than one available machine is a typical combinatorial optimisation problem under certain constraints. It has significant impact not only on the whole process planning but also on scheduling, as well as on the integration of process planning and scheduling. Targeting the potential adaptability of process plans associated with setups, a cross-machine setup planning approach using genetic algorithms (GA) for machines with different configurations is presented in this paper. First, based on tool accessibility analysis of different machine configurations, partially sequenced machining features can be grouped into certain setups; then by responding to the requirements from a scheduling system, optimal or near-optimal setup plans are selected for certain criteria, such as cost, makespan and/or machine utilisation. GA is adopted for the combinatorial optimisation, which includes gene pool generation based on tool accessibility examination, setup plan encoding and fitness evaluation, and optimal setup plan selection through GA operations. The proposed approach is implemented in a GA toolbox, and tested using a sample part. The results demonstrate that the proposed approach is applicable to machines with varying configurations, and adaptive to different setup requirements from a scheduling system due to machine availability changes. It is expected that this approach can contribute to process planning and scheduling integration when a process plan is combined with setups for alternative machines during adaptive setup planning.     

An approach to identify the optimal configurations and reconfiguration processes for design of reconfigurable machine tools

A reconfigurable machine tool (RMT) is a special machine that can deliver different machining functions through reconfiguration processes among its configurations during the machine utilisation stage. In this research, a new approach is developed to identify the optimal configurations and the reconfiguration processes for design of the RMTs. In this work, a generic design AND-OR tree is used to model different design solution candidates, their machine configurations and parameters of these configurations. A specific design solution is created from the generic design AND-OR tree through tree-based search and modelled by different machine configurations. For a reconfiguration process between two machine configurations, a generic process AND-OR graph is used to model reconfiguration operation candidates, sequential constraints among operations and operation parameters. A graph-based search is used to generate all feasible reconfiguration process candidates from the generic process AND-OR graph. The optimal design is identified by multi-level and multi-objective hybrid optimisation. A case study is developed to show how this new approach is used for the optimal design of a RMT.     

Reconfigurability consideration and scheduling of products in a manufacturing industry

Reconfigurable manufacturing system is a new type of manufacturing system which can change its capacity and functionality very easily and quickly whenever required. RMS (reconfigurable manufacturing system) has capacity and functionality exactly what is required. RMS is adjustable to the fluctuating demands and it can be easily upgraded with new process technology. Reconfigurability of a manufacturing system is measured in terms of cost, effort and time. It is the ability of a manufacturing system to be reconfigured quickly with low reconfiguration effort at low cost. In the present work, reconfigurability has been considered in Continental Automotive Components Pvt. Ltd. on the basis of RMS principles. A modified reconfigurable layout has been proposed for an assembly line and scheduling of the products has been done for the criteria reconfiguration effort, profit over cost and due date. Scheduling of the products has been done using the integrated approach of Shannon entropy and RIM (Reference Ideal Method). R program has been written for scheduling. Sensitivity analysis has been conducted for the problem.     

Robust optimisation of machining conditions with tool life and surface roughness uncertainties

The economics of the multi-pass turning problem is considered, while accounting for tool life uncertainty. The goal is to minimise the expected production cost per part, given the probability distribution for tool life, and with machining parameters being subject to practical constraints. The cost function accounts for machining cost, idling cost, tool changing cost as well as the cost associated with tool failure. A modified version of the particle swarm optimisation (PSO) algorithm, called the dynamic objective PSO (or DOPSO), is used for minimisation of the cost function. The decision variables include not only the machining parameters but also the tool replacement time. The equality constraint that the total desired depth of cut be achieved by an integral number of roughing passes and a single finishing pass is handled in a novel way, and together with including tool replacement time as a decision variable, this leads to lower costs than those cited by other comparable previous works. To handle uncertain constraints that lead to part failure when violated (e.g. desired surface finish), a robust formulation is also suggested through similar incorporation in the cost function, as for tool failure.     

An improved imperialist competitive algorithm based photolithography machines scheduling

Abstract: Photolithography machine is one of the most expensive equipment in semiconductor manufacturing system, and as such is often the bottleneck for processing wafers. This paper focuses on photolithography machines scheduling with the objective of total completion time minimisation. In contrast to classic parallel machines scheduling, it is characterised by dynamical arrival wafers, re-entrant process flows, dedicated machine constraints and auxiliary resources constraints. We propose an improved imperialist competitive algorithm (ICA) within the framework of a rolling horizon strategy for the problem. We develop a variable time interval-based rolling horizon strategy to decide the scheduling point. We address the global optimisation in every local scheduling by proposing a mixed cost function. Moreover, an adaptive assimilation operator and a sociopolitical competition operator are used to prevent premature convergence of ICA to local optima. A chaotic sequence-based local search method is presented to accelerate the rate of convergence. Computational experiments are carried out comparing the proposed algorithm with ILOG CPLEX, dispatching rules and meta-heuristic algorithms in the literature. It is observed that the algorithm proposed shows an excellent behaviour on cycle time minimisation while with a good on time delivery rate and machine utilisation rate.     

面向大批量定制的可重组自动化装备

在大批量定制正在成为２１世纪制造业的主流生产模式的背景下,对国内外可重组自动化装备的研究现状和国内装备制造业存在的问题进行了分析,提出了发展面向大批量定制的可重组自动化装备的设想,包括面向大批量定制的可重组自动化装备发展战略和设计方法学的研究、开放式数控系统研究、面向大批量定制的可重组机床的可重组制造系统的研究等．