Concurrent consideration of product design,process planning and production planning activities

In manufacturing engineering, product design, process planning and production planning activities are often considered independently. However, in order to effectively respond to changes in business situations, such as changes in demand forecast, product mix and technology, it is desirable to consider them concurrently. For this purpose, a large-scale linear programming model has been developed. The model considers minimization of the sum of processing cost, late shipment cost and inventory holding cost as the objective, and concurrently selects product designs, and generates process plans and production plans. The number of columns in the formulation can be large and, hence, an efficient column generation scheme is developed to solve the model. The model and solution procedure are illustrated with examples.     

Uncertainty Analysis Based on Probability Bounds (P-Box) Approach in Probabilistic Safety Assessment

A wide range of uncertainties will be introduced inevitably during the process of performing a safety assessment of engineering systems. The impact of all these uncertainties must be addressed if the analysis is to serve as a tool in the decision-making process. Uncertainties present in the components (input parameters of model or basic events) of model output are propagated to quantify its impact in the final results. There are several methods available in the literature, namely, method of moments, discrete probability analysis, Monte Carlo simulation, fuzzy arithmetic, and Dempster-Shafer theory. All the methods are different in terms of characterizing at the component level and also in propagating to the system level. All these methods have different desirable and undesirable features, making them more or less useful in different situations. In the probabilistic framework, which is most widely used, probability distribution is used to characterize uncertainty. However, in situations in which one cannot specify (1) parameter values for input distributions, (2) precise probability distributions (shape), and (3) dependencies between input parameters, these methods have limitations and are found to be not effective. In order to address some of these limitations, the article presents uncertainty analysis in the context of level-1 probabilistic safety assessment (PSA) based on a probability bounds (PB) approach. PB analysis combines probability theory and interval arithmetic to produce probability boxes (p-boxes), structures that allow the comprehensive propagation through calculation in a rigorous way. A practical case study is also carried out with the developed code based on the PB approach and compared with the two-phase Monte Carlo simulation results.     

Managing Logistics in Regional Banknote Supply Chain Under Security Concerns

We study the logistics problem faced by Regional Branches (RBs) of a central bank in managing the currency supply under security concerns. While making banknote supply decisions to Sub‐Branches (SBs), the management of RB must achieve two goals simultaneously: (i) guarantee that each SB has sufficient inventories of all denominations of banknotes to satisfy the demands from all commercial banks within its service area, and (ii) control the annual spending on this banknote supply operation. Due to security concerns, the following methods are implemented in the process of transporting banknotes: (i) the capacity of a cash truck is limited by the total face value (instead of the physical space) of banknotes, and (ii) empty decoy trucks are deployed along with the trucks filled with banknotes. After deriving a polynomial‐time strategy to guarantee an optimal solution for the special Bin‐Packing Problem faced in this study, we provide an exact formulation for the RB's supply planning problem. We also propose several polynomial‐time algorithms for deriving either optimal or near‐optimal solutions for the problem under different settings. Using the weekly demand data obtained from the central bank, we verify the performance of our algorithms, and analyze the impacts of changes in these features and in the fleet capacity on the total cost incurred by an RB under various scenarios.     

Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach

Class-based storage policy distributes products among a number of classes and for each class it reserves a region within the storage area. The procedures reported in the literature for formation of storage classes primarily consider order-picking cost ignoring storage-space cost. Moreover, in these procedures items are ordered on the basis of their cube per order index (COI), and items are then partitioned into classes maintaining this ordering. This excludes many possible product combinations in forming classes which may result in inferior solutions. In this paper, a simulated annealing algorithm (SAA) is developed to solve an integer programming model for class formation and storage assignment that considers all possible product combinations, storage-space cost and order-picking cost. Computational experience on randomly generated data sets and an industrial case shows that SAA gives superior results than the benchmark dynamic programming algorithm for class formation with COI ordering restriction.     

On the equivalence of two approaches to simplicity in the analysis of block designs and some related results

Two seemingly different approaches to simplicity in the analysis of connected block designs, and their relationship to the concepts of balance are discussed.     

Optimum mixture designs in a restricted region

In a mixture experiment, the response depends on the proportions of the mixing components. Canonical models of different degrees and also other models have been suggested to represent the mean response. Optimum designs for estimation of the parameters of the models have been investigated by different authors. In most cases, the optimum design includes the vertex points of the simplex as support points of the design, which are not mixture combinations in the true non-trivial sense. In this paper, optimum designs have been obtained when the experimental region is an ellipsoidal subspace of the entire factor space which does not cover the vertex points of the simplex.     

Estimating ordered quantiles of two exponential populations with a common minimum guarantee time

The problem of estimating ordered quantiles of two exponential populations is considered, assuming equality of location parameters (minimum guarantee times), using the quadratic loss function. Under order restrictions, we propose new estimators which are the isotonized version of the MLEs, call it, restricted MLE. A sufficient condition for improving equivariant estimators is derived under order restrictions on the quantiles. Consequently, estimators improving upon the old estimators have been derived. A detailed numerical study has been done to evaluate the performance of proposed estimators using the Monte-Carlo simulation method and recommendations have been made for the use of the estimators.     

The quantile-based flattened logistic distribution: Some properties and applications

In this paper, the quantile-based flattened logistic distribution has been studied. Some classical and quantile-based properties of the distribution have been obtained. Closed form expressions of L-moments, L-moment ratios and expectation of order statistics of the distribution have been obtained. A quantile-based analysis concerning the method of matching L-moments estimation is employed to estimate the parameters of the proposed model. We further derive the asymptotic variance–covariance matrix of the matching L-Moments estimators of the proposed model. Finally, we apply the proposed model to simulated as well as two real life datasets and compare the fit with the logistic distribution.