Functional properties of throughput in tandem lines with unreliable servers and finite buffers

optimization;queueing theory;production

Sample-Path Optimization of Buffer Allocations in a Tandem Queue - Part I:Theoretical Issues

This is the first of two papers dealing with the optimal bu er allocation problem in tandem manufacturing lines with unreliable machines.We address the theoretical issues that arise when using sample-path optimization, a simulation-based optimization method, to solve this problem.Sample-path optimization is a recent method to optimize performance functions of stochastic systems.By exploiting the fact that the performance function we want to optimize is the almost sure limit of a sequence of random functions, it overcomes some of the di culties from which variants of stochastic approximation methods su er.We provide a mathematical framework that makes use of a function space construction to model the dependence of throughput on bu er capacities and maximum ow rates of machines.Using this framework we prove various structural properties of throughput and show how these properties, along with a niceness condition on the steady-state, can be used to prove that the sample-path optimization method converges almost surely when applied to the bu er allocation problem.Among the properties established, monotonicity in bu er capacities and in ma- chine ow rates are especially important.Although monotonicity results of this nature have appeared in the literature for discrete tandem lines, as far as we are aware the kind of analysis we present here has not yet been done for continuous tandem lines.

Performance Evaluation of Remanufacturing Systems

Implementation of new environmental legislation and public awareness has increased the responsibility on manufacturers. These responsibilities have forced manufacturers to begin remanufacturing and recycling of their goods after they are disposed or returned by customers. Ever since the introduction of remanufacturing, it has been applied in many industries and sectors. The remanufacturing process involves many uncertainties like time, quantity, and quality of returned products. Returned products are time sensitive products and their value drops with time. Thus, the returned products need to be remanufactured quickly to generate the maximum revenue. Every year millions of electronic products return to the manufacturer. However, only 10% to 20% of the returned products pass through the remanufacturing process, and the remaining products are disposed in the landfills. Uncertainties like failure rate of the servers, buffer capacity and inappropriate preventive maintenance policy would be highly responsible the delays in remanufacturing. In this thesis, a simulation based experimental methodology is used to determine the optimal preventive maintenance frequency and buffer allocation in a remanufacturing line, which will help to reduce the cycle time and increase the profit of the firm. Moreover, an estimated relationship between preventive maintenance frequency and MTBF (Mean Time Between Failure) is presented to determine the best preventive maintenance frequency for any industry. The solution approach is applied to a computer remanufacturing and a cell phone remanufacturing industry. Analysis of variance and regression analysis are performed to denote the influential factors in the remanufacturing line, and optimization is done by using the regression techniques and ANOVA results

On the Inversion of High Energy Proton

Inversion of the K-fold stochastic autoconvolution integral equation is an elementary nonlinear problem, yet there are no de facto methods to solve it with finite statistics. To fix this problem, we introduce a novel inverse algorithm based on a combination of minimization of relative entropy, the Fast Fourier Transform and a recursive version of Efron's bootstrap. This gives us power to obtain new perspectives on non-perturbative high energy QCD, such as probing the ab initio principles underlying the approximately negative binomial distributions of observed charged particle final state multiplicities, related to multiparton interactions, the fluctuating structure and profile of proton and diffraction. As a proof-of-concept, we apply the algorithm to ALICE proton-proton charged particle multiplicity measurements done at different center-of-mass energies and fiducial pseudorapidity intervals at the LHC, available on HEPData. A strong double peak structure emerges from the inversion, barely visible without it.Comment: 29 pages, 10 figures, v2: extended analysis (re-projection ratios, 2D

Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds

The allocation of buffer space in flow lines with stochastic processing times is an important decision, as buffer capacities influence the performance of these lines. The objective of this problem is to minimize the overall number of buffer spaces achieving at least one given goal production rate. We optimally solve this problem with a mixed-integer programming approach by sampling the effective processing times. To obtain robust results, large sample sizes are required. These incur large models and long computation times using standard solvers. This paper presents a Benders Decomposition approach in combination with initial bounds and different feasibilitycutsfortheBufferAllocationProblem,whichprovidesexactsolutionswhile reducing the computation times substantially. Numerical experiments are carried out to demonstrate the performance and the flexibility of the proposed approaches. The numerical study reveals that the algorithm is capable to solve long lines with reliable and unreliable machines, including arbitrary distributions as well as correlations of processing times