Simulation of unbalanced buffer allocation in unreliable unpaced production lines

This article presents the results of a study investigating the performance of unpaced unreliable production lines (i.e. subject to breakdown) that are unbalanced in terms of their buffer storage sizes. Simulation is carried out for five, eight and 10 station lines with mean buffer space set at two, four and six units. Buffer capacity is allocated in different configurations for each of these lines. Performance indicators on throughput, idle time and average buffer level are analysed using a range of statistical tools, and relationships between the independent and dependent variables are determined. Overall results show that the best patterns for unreliable lines in terms of generating higher throughput rates (or lower idle times) as compared to a balanced line are those where total available buffer capacity is allocated as evenly as possible between workstations. In contrast, concentrating more buffer capacity towards the end of the line gives best average buffer level results.     

Optimal buffer allocation in production lines

The optimal allocation of buffers in production lines is an important research issue in the design of a manufacturing system. We present a new hybrid algorithm for this complex design problem: the hybrid Nested Partitions (NP) and Tabu Search (TS) method. The Nested Partitions method is globally convergent and can utilize many of the existing heuristic methods to speed up its convergence. In this paper, we incorporate the Tabu Search heuristic into the NP framework and demonstrate through numerical examples that using the hybrid method results in superior solutions. Our numerical results illustrate that the new algorithm is very efficient for buffer allocation problems in large production lines.     

Optimal buffer inventory and preventive maintenance for an imperfect production process

In this paper we present a model to determine the optimal length of continuous production periods between maintenance actions and the optimal buffer inventory to satisfy demand during preventive maintenance or repair of a manufacturing facility. We include in the model the possibility of imperfect production. We consider that the duration and cost of the maintenance action depend on the state of the production facility.     

A tabu search approach for buffer allocation in production lines with unreliable machines

The optimal allocation of buffers is an important research issue in designing production lines. In this study, a tabu search (TS) algorithm is proposed to find near-optimal buffer allocation plans for a serial production line with unreliable machines. The main objective is to maximize the production rate, i.e. throughput, of the line. The efficiency of the proposed method is also tested to solve buffer allocation problems with the objective of total buffer size minimization. To estimate the throughput of the line with a given specific buffer allocation, an analytical decomposition approximation method is used. The performance of the tabu search algorithm is demonstrated on existing benchmark problems. The results obtained by the TS algorithm are clearly encouraging, as the TS algorithm is much better than the other algorithms for all considered benchmark problems.     

A decision support system for the design of unpaced production lines

Consider a realistic unpaced-line problem: there is a set of discrete tasks, whose task-time distributions have diverse shapes. The line designer must (i) decide to which work station to assign each task, and (ii) specify the size of each buffer area in such a way that the configuration has the ‘best’ operating characteristics. This paper describes a decision support package that can efficiently generate the operating characteristics of the many alternative line designs which the line designer may want to try. We also show that the package can be conveniently used to extend earlier results in theoretical unpaced-line research.     

Cash-flow-oriented buffer allocation in stochastic flow lines

This paper defines the problem of buffer space allocation in flow lines as an investment problem. A model is developed and solution techniques are described that can be used to determine buffer allocations that maximize the expected net present value of the investment, including machines, buffers and inventory. Production rates and inventory levels are explicitly linked to projected cash flow to assess the economic consequences of the buffer allocation. Several examples of linear flow lines as well as assembly/disassembly systems and flow lines with rework loops are analysed numerically. These examples demonstrate the importance of the buffer allocation problem and provide intuition with respect to the structure of optimized solutions. A result is that as product quality in a system with a rework loop improves, an optimally designed system can receive more buffer spaces and may use more inventory. This possibly counterintuitive result is due to the economic perspective on the buffer allocation problem.     

Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation

Buffer allocation in serial production lines is one of the important design issues, and hence it has been studied extensively in the literature. In this paper, we analyse the problem to characterise the optimal buffer allocation; specifically, we study the cases with single and multiple bottleneck stations under various experimental conditions. In addition, we develop an efficient heuristic procedure to allocate buffers in serial production lines to maximise throughput. The results of the computational experiments indicate that the proposed algorithm is very efficient in terms of both solution quality and CPU time requirements. Moreover, the characterisation study yields interesting findings that may lead to important practical implications. A comprehensive bibliography is also provided in the paper.     

Worker allocation in lean U-shaped production lines

U-shaped lines are widely used in lean systems. In U-shaped production lines, each worker handles one or more machines on the line: the worker allocation problem is to establish which machines are handled by which worker. This differs from the widely-investigated U-line assembly line balancing problem in that the assignment of tasks to line locations is fixed. This paper address the worker allocation problem for lean U-shaped production lines where the objectives are to minimize the quantity of workers and maximize full work: such allocations provide the opportunity to eliminate the least-utilized worker by improving processes accordingly. A mathematical model is developed: the model allows for any allocation of machines to workers so long as workers do not cross paths. Walking times are considered, where workers follow circular paths and walk around other worker(s) on the line if necessary. A heuristic algorithm for tackling the problem is developed, along with a procedure representing the ‘traditional’ approach of constructing standard operations routines. Computational experiments considering three line sizes (up to 20 machines) and three takt time levels are performed. The results show that the proposed algorithm both improves upon the traditional approach and is more likely to provide optimal solutions.     

A segmentation approach for solving buffer allocation problems in large production systems

Buffer space allocation is an important step in production line design. In this paper, we focus on maximising the profit rate of a line subject to a production rate constraint. We describe a newly observed property of production line optimisation. The property is that the production rate constraint, if it is effective, allows an original line to be decoupled into several short lines for optimisation. An approximation method is developed from this property. Instead of optimising a long line, the method divides it into several short lines, optimises them separately and combines their optimal buffer distributions to find the optimal or near optimal buffer distribution of the original line. The method greatly improves the computation efficiency for solving buffer allocation problem for long lines, while ensuring the accuracy of the optimal buffer distribution. A heuristic explanation is proposed. Numerical experiments are provided to show the accuracy and efficiency of the method. The effect of the number and length of line segments on the performance of the method is discussed.     

Optimal preventive maintenance in a production inventory system

We consider a production inventory system that produces a single product type, and inventory is maintained according to an (S, s) policy. Exogenous demand for the product arrives according to a random process. Unsatisfied demands are not back ordered. Such a make-to-stock production inventory policy is found very commonly in discrete part manufacturing industry, e.g., automotive spare parts manufacturing. It is assumed that the demand arrival process is Poisson. Also, the unit production time, the time between failures, and the repair and maintenance times are assumed to have general probability distributions. We conjecture that, for any such system, the down time due to failures can be reduced through preventive maintenance resulting in possible increase in the system performance. We develop a mathematical model of the system, and derive expressions for several performance measures. One such measure (cost benefit) is used as the basis for optimal determination of the maintenance parameters. The model application is explained via detailed study of 21 variants of a numerical example problem. The optimal maintenance policies (obtained using a numerical search technique) vary widely depending on the problem parameters. Plots of the cost benefit versus the system characteristic parameters (such as, demand arrival rate, failure rate, production rate, etc.) reveal the parameter sensitivities. The results show that the actual values of the failure and maintenance costs, and their ratio are significant in determining the sensitivities of the system parameters.     

Buffer capacity allocation for a desired throughput in production lines

In this study, we are concerned with finding the minimum-total-buffer allocation for a desired throughput in production lines with phase-type processing times. We have implemented a dynamic programming algorithm that uses a decomposition method to approximate the system throughput at every stage. We provide numerical examples to show the buffer allocation and compare the corresponding simulated throughput and its bounds with the desired throughput.     

Optimal design of production lines

A model is presented for jointly determining the profit-maximizing number of workstations and interstation buffer capacities for stochastic unpaced lines. Several important implementation issues are discussed and system sensitivities examined, providing the line designer with new and important tools and insights.     

Optimal production and inventory decisions under demand and production disruptions

Unanticipated events may take place and disrupt demand and/or production in a supply chain. Conditional on the type, magnitude and duration of disruptions, changes may be called to revise the original production plan. We analyse different disruption scenarios and propose optimal production–inventory models for products facing demand and production disruptions. To lower the cost, we optimise the production run time, purchasing times and order quantity for the manufacturer. Numerical experiments are conducted to examine the influences of disruption time and magnitude on optimal production and purchasing decisions.     

A two-phase heuristic algorithm for determining buffer sizes of production lines

In-process inventories are often used in many manufacturing systems to smooth and balance work flow. The buffer design problem of determining the best size of storage space between operations (or workstations) is one that has been approached in past and current research issues. Although past research attempted to apply traditional optimization methods to the buffer design problems, the applications revealed that some fundamental drawbacks were occurring due to the unique characteristics of the buffer design in the production lines. This paper addresses the unique characteristics involved in the buffer design, discusses drawbacks of traditional optimization methods applied, and finally presents an efficient two-phase heuristic method using a dimension reduction strategy and a buffer utilization-based beam search method, fn addition, numerical results show sensitivity analyses for the performance of the heuristic method with respect to parameters involved in the second phase of the method.     

The buffer allocation problem for general finite buffer queueing networks

The Buffer Allocation Problem (BAP) is a difficult stochastic, integer, nonlinear programming problem. In general, the objective function and constraints of the problem are not available in a closed form. An approximation formula for predicting the optimal buffer allocation is developed based upon a two-moment approximation formula involving the expressions for M/ M/1/ K systems. The closed-form expressions of the M/ M/1/ K and M/ G/1/ K systems are utilized for the BAP in series, merge, and splitting topologies of finite buffer queueing networks. Extensive computational results demonstrate the efficacy of the approach.     

Preventive maintenance and optimal buffer inventory for products sold with warranty in an imperfect production system

This paper deals with an imperfect production system with allowable shortages due to regular preventive maintenance for products sold with free minimal repair warranty. Preventive maintenance is an essential factor of the just-in-time structure that results in a shutdown of the production process for a certain period of time. During such an interruption, a buffer stock is needed to adjust the market demand. The study includes the possibility of imperfect production and determines the optimum buffer level and production run time by trading off the holding cost, shortage cost, rework cost, repair cost for warranty, labour/energy costs, material cost and cost for maintenance so that the cost per unit product is minimised.     

The effects of work-in-process inventory costs on the design and scheduling of assembly lines with low throughput and high component costs

This paper considers a class of assembly systems with long cycle times (low volume of output) and highly expensive components or subassemblies. Systems such as these are typical for companies in the aerospace industry assembling missiles and airplanes. As each unit of the product moves along the assembly line, its value increases owing to additional parts or components installed and the additional work performed. We show that sequencing activities according to ascending values of the ratios of the 'value added' to activity duration minimizes inventory holding cost within a given workstation. A branch-and-bound procedure is then used to allocate activities optimally to a given number of workstations. The objective function used in this paper is to maximize the net profit of a production line, which comprises net revenues minus inventory holding costs and fixed costs of workstations. The design of the assembly line is affected by two decision variables: number of workstations and cycle time. Finally, it is shown that a 'balanced' line is not necessarily an optimal one and 'pushing' activities to the right (the end of the assembly line) may reduce total holding costs and improve the profitability of the line.     

A fast algorithm for buffer allocation problem

In this paper, we address the problem of seeking optimal buffer configurations in unreliable production lines with the objective of maximising their production rates. A fast algorithm is proposed for solving the problem. The key idea is to decompose a long production line into a set of overlapping three-machine two-buffer systems. The performance of the algorithm is demonstrated by a comparison with the degraded ceiling (DC) algorithm. Numerical results show that the proposed algorithm is almost as accurate as the DC algorithm, but it is much faster, especially for long production lines.