Analysis of an automobile assembly line as a network of closed loops working in both,stationary and transitory regimes

In this work a real automobile assembly line and the correspondent preassembly lines have been analyzed as a network of closed loops of machines decoupled by intermediate buffers. This work deals with some important aspects, which have still not been investigated in earlier literature, such as: machines processing pallets, which are not related to each other and depend on an external variable in a network with closed loops of machines and intermediate buffers, machines working at different cycle times in a network of closed loops of machines and intermediate buffers, machines working in both, stationary and transitory regime and the relationships between the cycle times of the machines in the stationary working regime in order to guarantee the production rate of the system. Finally how the transient results can be used to improve the performance of the system under certain working conditions is discussed.     

Throughput centered prioritization of machines in transfer lines

In an environment of scarce resources and complex production systems, prioritizing is key to confront the challenge of managing physical assets. In the literature, there exist a number of techniques to prioritize maintenance decisions that consider safety, technical and business perspectives. However, the effect of risk mitigating elements—such as intermediate buffers in production lines—on prioritization has not yet been investigated in depth. In this line, the work proposes a user-friendly graphical technique called the system efficiency influence diagram (SEID). Asset managers may use SEID to identify machines that have a greater impact on the system throughput, and thus set prioritized maintenance policies and/or redesign of buffers capacities. The tool provides insight to the analyst as it decomposes the influence of a given machine on the system throughput as a product of two elements: (1) system influence efficiency factor and (2) machine unavailability factor. We illustrate its applicability using three case studies: a four-machine transfer line, a vehicle assembly line, and an open-pit mining conveyor system. The results confirm that the machines with greater unavailability factors are not necessarily the most important for the efficiency of the production line, as it is the case when no intermediate buffers exist. As a decision aid tool, SEID emphasizes the need to move from a maintenance vision focused on machine availability, to a systems engineering perspective.     

Modeling and Analysis of Assembly Systems with Unreliable Machines and Finite Buffers

An assembly line is a tree-structured manufacturing system in which some machines perform assembly operations. In this paper, we consider assembly lines with the following features: every operation is performed in a fixed amount of time, machines are unreliable, and buffers have finite capacity. Usually, the times to failures of machines are much larger than the processing times. This allows us to approximate the behavior of these systems by a continuous flow model. The behavior of this model is then analyzed using a decomposition technique which is an extension of an earlier technique proposed in the case of transfer lines. An efficient algorithm for calculating performance measures such as production rate and average buffer levels is derived. Experimental results are provided showing mat this approximate method is quite accurate.     

Performance analysis of production systems with rework loops

This paper presents an overlapping decomposition method to approximate the throughput of production systems with rework loops. The idea is to decompose the system into overlapped serial production lines, with the overlapping machines modified to accommodate the interactions with machines and buffers in other lines. The convergence of the iterative procedure and the uniqueness of the solution are proved analytically. The accuracy of the estimate is justified numerically and illustrated by a case study at an automotive assembly plant.     

Mixed integer programming for scheduling surface mount technology lines

This paper presents new mixed integer programming formulations for blocking scheduling of SMT (Surface Mount Technology) lines for printed wiring board assembly. The SMT line consists of several processing stages in series, separated by finite intermediate buffers, where each stage has one or more identical parallel machines. A board that has completed processing on a machine may remain there and block the machine until a downstream machine becomes available for processing. The objective is to determine an assembly schedule for a mix of board types so as to complete the boards in a minimum time. Scheduling with continuous or with limited machine availability is considered. Numerical examples and some computational results are presented to illustrate applications of the models proposed.     

Availability and throughput of unreliable,unbuffered production lines with non-homogeneous deterministic processing times

This paper studies production lines composed of several serial machines which are subject to random operation-dependent failures. The production lines have no intermediate buffers between adjacent machines. Machines have different deterministic processing times. The purpose of this paper is to propose analytical models to assess steady-state availability and throughput of such lines. Thousands of production line configurations have been experimented to compare the performance of the proposed approach to approximate existing techniques. A general simulation model was developed and statistical tests carried out to prove that the proposed approach is exact and robust to model unreliable, unbuffered, and non-homogeneous production lines.     

Throughput and average inventory in discrete balanced assembly systems

We consider an assembly system consisting of two input machines and an assembly machine, with finite buffers between each input machine and the assembly machine, where all machines operate at deterministic and equal rates, and input machines are subject to random failures. Under the assumption that probabilities of failure and repair are constant during each cycle time (i.e., failure times and repair times are geometric random variables), we derive the steady-state average throughput and inventories for the system.     

Availability consideration in the optimal selection of multiple-aspect RMS configurations

Machine availability has a profound influence on the performance of manufacturing systems. This paper extends a model for optimizing reconfigurable manufacturing systems (RMS) configurations with multiple-aspects to incorporate the effect of machine availability using the universal generating function (UGF). Two powerful meta-heuristic optimization techniques, namely genetic algorithms (GAs) and tabu search (TS), are used for optimizing the capital cost and system availability of the RMS configurations. The optimized configurations can handle multiple-parts and their structure is that of flow lines allowing paralleling of identical machines in each production stage. The various aspects considered in the RMS configurations include arrangement of machines, equipment selection and assignment of operations. A case study is presented and implementation of the optimization model is carried out using MATLAB software. The results of using both GAs and TS to solve the problem are then reported and compared for validation. Analysis of different cases of availability consideration including infinite and no buffer capacity is performed and results are compared to those obtained when machine availability is not considered. It has been shown that considering availability affects the optimal configuration selection and increases the required equipment. This increases the costs of the near-optimal configurations obtained especially in the case without buffers. The presented model can support the manufacturing systems configuration selection decisions at both the initial design and reconfiguration stages.     

Throughput analysis of production systems: recent advances and future topics

Throughput analysis is important for the design, operation and management of production systems. A substantial amount of research has been devoted to developing analytical methods to estimate the throughput of production systems with unreliable machines and finite buffers. In this paper we summarise the recent studies in this area. In addition to the performance evaluation of serial lines, approximation methods for more complex systems, such as assembly/disassembly systems, parallel lines, split and merge, closed-loop systems, etc., are discussed. Moreover, we propose future research topics from the automotive manufacturing systems perspective.     

Joint optimization of maintenance,buffers and machines in manufacturing lines

This article considers a series manufacturing line composed of several machines separated by intermediate buffers of finite capacity. The goal is to find the optimal number of preventive maintenance actions performed on each machine, the optimal selection of machines and the optimal buffer allocation plan that minimize the total system cost, while providing the desired system throughput level. The mean times between failures of all machines are assumed to increase when applying periodic preventive maintenance. To estimate the production line throughput, a decomposition method is used. The decision variables in the formulated optimal design problem are buffer levels, types of machines and times between preventive maintenance actions. Three heuristic approaches are developed to solve the formulated combinatorial optimization problem. The first heuristic consists of a genetic algorithm, the second is based on the nonlinear threshold accepting metaheuristic and the third is an ant colony system. The proposed heuristics are compared and their efficiency is shown through several numerical examples. It is found that the nonlinear threshold accepting algorithm outperforms the genetic algorithm and ant colony system, while the genetic algorithm provides better results than the ant colony system for longer manufacturing lines.     

Determination of Optimal Buffer Storage Capacities and Optimal Allocation in Multistage Automatic Transfer Lines

One way to improve the efficiency of automatic transfer lines is to provide intermediate storage buffers. These buffers divide the transfer line into stages, each with one or more machines. The machines in a stage are completely integrated, whereas, the stages are partially decoupled. Here, we study a problem related to buffer storage allocation. The objective is to find optimal distribution of a total storage space among the intermediate buffers. This is formulated as a dynamic programming problem and a heuristic solution is presented.     

An efficient analytical method for performance evaluation of transfer lines with unreliable machines and finite transfer-delay buffers

Buffers are widely adopted in transfer lines to reduce the fluctuations caused by the imbalances of systems or machine failures. This paper presents an efficient analytical method to evaluate the performance of transfer lines with unreliable machines and finite transfer-delay buffers. Firstly, the buffers with transfer delays are transformed equivalently into a series of perfect machines and buffers without transfer delays. Correspondingly, the initial transfer line is replaced by an equivalent transfer line with more machines and zero-transfer-delay buffers. Since in the equivalent transfer line the orders of magnitude of machines’ reliability parameters (mean times between failures and mean times to repair) are not at the same level, an advanced decomposition method is introduced to analyse the equivalent transfer line, using the general-exponential distributions instead of the exponential distributions to approximate the repair time distributions of the fictitious machines. Finally, extensive simulation and numerical cases are carried out to verify the performance of the developed method.     

Transient behavior of serial production lines with Bernoulli machines

The steady-state performance of production systems with unreliable machines has been analyzed extensively during the last 50 years. In contrast, the transient behavior of these systems remains practically unexplored. Transient characteristics, however, may have significant manufacturing implications. Indeed, if, for example, transients are sluggish and the steady state is reached only after a relatively long settling time, the production system may lose some of its throughput, thus leading to a lower efficiency. This paper is devoted to analytical and numerical investigation of the transient behavior of serial production lines with machines having the Bernoulli reliability model. The transients of the states (i.e., the probabilities of buffer occupancy) are described by the Second Largest Eigenvalue (SLE) of the transition matrix of the associated Markov chain. The transients of the outputs (i.e., production rate, PR, and work-in-process, WIP) are characterized by both the SLE and Pre-Exponential Factors (PEF). We study SLE and PEF as functions of machine efficiency, buffer capacity and the number of machines in the system. In addition, we analyze the settling times of PR and WIP and show that the former is often much shorter than the latter. Finally, we investigate production losses due to transients and show that they may be significant in serial lines with relatively large buffers and many machines. To avoid these losses, it is suggested that all buffers initially be half full. For two- and three-machine lines these analyzes are carried out analytically; longer lines are investigated by simulations.     

Optimal versus heuristic scheduling of surface mount technology lines

This paper presents and compares an exact and a heuristic approach for scheduling of printed wiring board assembly in surface mount technology (SMT) lines. A typical SMT line consists of several assembly stations in series and/or in parallel, separated by finite intermediate buffers. The objective of the scheduling problem is to determine the detailed sequencing and timing of all assembly tasks for each individual board, so as to maximize the line's productivity, which is defined in terms of makespan for a mix of board types. The limited intermediate buffers between stations result in a scheduling problem with machine blocking, where a completed board may remain on a machine and block it until a downstream machine becomes available. In addition, limited machine availability due to scheduled downtimes is considered. The exact approach is based on a mixed integer programming formulation that can be used for optimization of assembly schedules by using commercially available software for integer programming, whereas the heuristic approach is designed as a combination of tabu search and a set of dispatching rules. Numerical examples modelled after real-world SMT lines and some computational results are provided to illustrate and compare the two approaches.     

An approximation method for performance analysis of assembly/disassembly systems with parallel-machine stations

This note presents an efficient approximation method to evaluate the performance of tree-structured Assembly/Disassembly (AD) systems in which each station consists of multiple identical machines. It is assumed that the times to failure, times to repair, and processing times are exponentially distributed and the capacities of the buffers are finite. The method transforms an AD system with parallel machines in each station to an (approximately) equivalent AD system with a single machine in each station. After the transformation, a decomposition algorithm is used to analyze the performance of the transformed system. The results of computational experiments show that the suggested method gives good estimates in a short time.     

Integrated quality and quantity modeling of a production line

During the past three decades, the success of the Toyota Production System has spurred much research in manufacturing systems engineering. Productivity and quality have been extensively studied, but there is little research in their intersection. The goal of this paper is to analyze how production system design, quality, and productivity are inter-related in small production systems. We develop a new Markov process model for machines with both quality and operational failures, and we identify important differences between types of quality failures. We also develop models for two-machine systems, with infinite buffers, buffers of size zero, and finite buffers. We calculate total production rate, effective production rate (ie, the production rate of good parts), and yield. Numerical studies using these models show that when the first machine has quality failures and the inspection occurs only at the second machine, there are cases in which the effective production rate increases as buffer sizes increase, and there are cases in which the effective production rate decreases for larger buffers. We propose extensions to larger systems. Correspondence to: Stanley B. GershwinWe are grateful for support from the Singapore-MIT Alliance, the General Motors Research and Development Center, and PSA Peugeot-Citroën.     

Risk-based analysis of manufacturing systems

A manufacturing system considered here consists of a machine that processes parts and an automatic conveyor that transports immediately a finished part to an assembly cell (i.e. a single workstation facility is examined). The system can hold a maximum number of processed parts on the conveyor, which determines its size. Modelling the system as a family of Birth–Death Processes with finite size in equilibrium, indexed by the system utilisation parameter, and depending on the concepts of system information and system entropy (i.e. mean information), we promote a risk-based analysis of manufacturing systems. The current number of processed parts on the conveyor determines the system particular states. The performance measures of a system are: risk (i.e. uncertainty) of the system (represented by system entropy), throughput of the system, utilisation of the machine, utilisation of the conveyor, and information range of the system. They are simultaneously investigated with respect to the system utilisation parameter, in order for an optimal trade-off among them to be established. This analysis is illustrated on the information linear, Erlang, Binomial and Pascal held manufacturing systems. Regarding the managerial insights, a use case of a system target output is considered, comparing the above system types. This approach can also be used for analysis of an assembly line consisting of multiple machines that have different operation times and buffers between them.     

Availability and Average Inventory of Balanced Assembly-Like Flow Systems

An assembly-like system is one that requires resources simultaneously from more than one input source and produces a single output. Here we consider a balanced assembly-like flow system, where an assembly machine is fed from storage buffers of two input machines that are subject to random failures, and compute its average throughput and average inventories. We also show how to optimize the buffer sizes in this system     

Performance evaluation of flow lines with non-identical and unreliable parallel machines and finite buffers

This paper examines serial production lines with unreliable non-identical parallel machines at each workstation and intermediate buffers with finite capacities. All machines are assumed to have exponential service times, times to failure and repair times. An efficient decomposition technique is introduced for the performance evaluation of such lines. Rather than replacing each parallel-machine workstation with an equivalent single-server workstation, the main contribution of this paper is the presentation of a direct approach to derive and apply decomposition equations directly for every parallel machine at each workstation. Experimental results indicate that such a method can provide a computationally efficient algorithm to analyse large serial unreliable multi-server production lines with a good accuracy compared against simulation and other available methods.     

An improved decomposition method for evaluating the performance of transfer lines with unreliable machines and finite buffers

In this paper, we consider transfer lines consisting of a series of machines separated by finite buffers. The processing time of each machine is deterministic and may be not identical. All machines are prone to operation-dependent failures, and the times between failures and the times to repair are assumed to be exponentially distributed. Many analytical methods have been developed to evaluate the performance of such lines. In general, these methods provide fairly accurate results. However, in some real cases where the orders of magnitude of machines’ reliability parameters (mean times between failures and mean times to repair) are not at the same level, the accuracy of these existing methods may not be good enough. The purpose of this paper is to propose an improved decomposition method that performs well even in the situation above. We use generalised exponential distributions instead of exponential distributions to approximate the repair-time distributions of the fictitious machines, and a new ADDX algorithm is developed to calculate the performance parameters such as the production rate and the average buffer levels. Numerical results indicate that the improved decomposition method provides more accurate results and converges in most cases. It is feasible and valid to evaluate the performance of transfer lines with unreliable machines and finite buffers.