99 research outputs found

    Closed-loop two-echelon repairable item systems

    Get PDF
    In this paper we consider closed loop two-echelon repairable item systems with repair facilities both at a number of local service centers (called bases) and at a central location (the depot). The goal of the system is to maintain a number of production facilities (one at each base) in optimal operational condition. Each production facility consists of a number of identical machines which may fail incidentally. Each repair facility may be considered to be a multi-server station, while any transport from the depot to the bases is modeled as an ample server. At all bases as well as at the depot, ready-for-use spare parts (machines) are kept in stock. Once a machine in the production cell of a certain base fails, it is replaced by a ready-for-use machine from that base's stock, if available. The failed machine is either repaired at the base or repaired at the central repair facility. In the case of local repair, the machine is added to the local spare parts stock as a ready-for-use machine after repair. If a repair at the depot is needed, the base orders a machine from the central spare parts stock to replenish its local stock, while the failed machine is added to the central stock after repair. Orders are satisfied on a first-come-first-served basis while any requirement that cannot be satisfied immediately either at the bases or at the depot is backlogged. In case of a backlog at a certain base, that base's production cell performs worse. To determine the steady state probabilities of the system, we develop a slightly aggregated system model and propose a special near-product-form solution that provides excellent approximations of relevant performance measures. The depot repair shop is modeled as a server with state-dependent service rates, of which the parameters follow from an application of Norton's theorem for Closed Queuing Networks. A special adaptation to a general Multi-Class MDA algorithm is proposed, on which the approximations are based. All relevant performance measures can be calculated with errors which are generally less than one percent, when compared to simulation results. \u

    Delay in a tandem queueing model with mobile queues : an analytical approximation

    Get PDF
    Abstract In this paper, we analyze the end-to-end delay performance of a tandem queueing system with mobile queues. Due to state-space explosion there is no hope for a numerical exact analysis for the joint-queue length distribution. For this reason, we present an analytical approximation that is based on queue length analysis. Through extensive numerical validation, we find that the queue length approximation exhibits excellent performance for light and moderate traffic load

    Simple Approximations for the Batch-Arrival Mx/G/1 Queue

    Full text link

    Residential mobility and local housing-market differences

    Get PDF
    The authors extend previous literature on variations in mobility rates across local housing markets by examining the linkage of mobility rates at the household level to the structure of local housing markets. The results suggest that residential mobility rates differ widely across local housing markets, substantiating the view that residential relocation is intimately intertwined with conditions at the local level. Local housing-market conditions also have different effects on mobility rates for renters and owner-occupiers. The results suggest that variation in residential mobility rates across housing markets can be in part explained by level of urbanization, the tenure structure, the degree of government intervention, and the size of the housing market. Remarkably, these differences in local housing markets cannot be seen to be related to housing-market features only. The results suggest that these differences can also be attributed to the behavior or attitude of households with respect to housing

    Three-dimensional reconstruction of myocardial contrast perfusion from biplane cineangiograms by means of linear programming techniques

    Get PDF
    The assessment of coronary flow reserve from the instantaneous distribution of the contrast agent within the coronary vessels and myocardial muscle at the control state and at maximal flow has been limited by the superimposition of myocardial regions of interest in the two-dimensional images. To overcome these limitations, we are in the process of developing a three-dimensional (3D) reconstruction technique to compute the contrast distribution in cross sections of the myocardial muscle from two orthogonal cineangiograms. To limit the number of feasible solutions in the 3D-reconstruction space, the 3D-geometry of the endo- and epicardial boundaries of the myocardium must be determined. For the geometric reconstruction of the epicardium, the centerlines of the left coronary arterial tree are manually or automatically traced in the biplane views. Next, the bifurcations are detected automatically and matched in these two views, allowing a 3D-representation of the coronary tree. Finally, the circumference of the left ventricular myocardium in a selected cross section can be computed from the intersection points of this cross section with the 3D coronary tree using B-splines. For the geometric reconstruction of the left ventricular cavity, we envision to apply the elliptical approximation technique using the LV boundaries defined in the two orthogonal views, or by applying more complex 3D-reconstruction techniques including densitometry. The actual 3D-reconstruction of the contrast distribution in the myocardium is based on a linear programming technique (Transportation model) using cost coefficient matrices. Such a cost coefficient matrix must contain a maximum amount of a priori information, provided by a computer generated model and updated with actual data from the angiographic views. We have only begun to solve this complex problem. However, based on our first experimental results we expect that the linear programming approach with advanced cost coefficient matrices and computed model will lead to a
    corecore