Coordination mechanisms for a three‐stage reverse supply chain to increase profitable returns

In this article, we consider a generic electronic product that can be remanufactured or recycled at the end of its life cycle to generate new profit. We first describe the product return process and then present a customer segmentation model to capture consumers' different behaviors with respect to product return so that the retailer can work more effectively to increase the return volume. In regard to the collaboration between the retailer and the manufacturer, we explore a revenue‐sharing coordination mechanism for achieving a win‐win outcome. The optimality and sensitivity of the critical parameters in four strategies are obtained and examined both theoretically and numerically, which generate insights on how to manage an efficient consumer‐retailer‐manufacturer reverse supply chain, as well as on the feasibility of simplifying such a three‐stage chain structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

General models for the supplier's all-unit quantity discount policy

The purpose of this article is to investigate some managerial insights related to using the all-unit quantity discount policies under various conditions. The models developed here are general treatments that deal with four major issues: (a) one buyer or multiple buyers, (b) constant or price-elastic demand, (c) the relationship between the supplier's production schedule or ordering policy and the buyers' ordering sizes, and (d) the supplier either purchasing or manufacturing the item. The models are developed with two objectives: the supplier's profit improvement or the supplier's increased profit share analysis. Algorithms are developed to find optimal decision policies. Our analysis provides the supplier with both the optimal all-unit quantity discount policy and the optimal production (or ordering) strategy. Numerical examples are provided. © 1993 John Wiley & Sons. Inc.     

Optimal location of a facility relative to area demands

This paper deals with the Weber single-facility location problem where the demands are not only points but may be areas as well. It provides an iterative procedure for solving the problem with l^p distances when p > 1 (a method of obtaining the exact solution when p = 1 and distances are thus rectangular already exists). The special case where the weight densities in the areas are uniform and the areas are rectangles or circles results in a modified iterative process that is computationally much faster. This method can be extended to the simultaneous location of several facilities.     

Estimation of the survival function of a repairable standby series system

This article deals with the statistical analysis of an N-component series system supported by an active standby and one repair facility. Assuming that the life and repair times of the components are independent exponential random variables, the probability distribution of the first passage to the system failure time is shown to be a convolution of two independent exponential distributions. Three observation schemes are considered to obtain the maximum likelihood estimates of the survival function. Information matrices are supplied. Numerical results based on Monte Carlo simulation are presented. It is noted that component level information (failure rate, repair rate) is not necessary for estimating the survival function of the system.     

Optimal inspection under semi-markovian deterioration: Basic results

This article develops a model for determining the optimal inspection schedule for a system which deteriorates according to a semi-Markov process that progresses through three states: good, defective, and bad. A binary test is used, and false positives may occur. A true positive results in an action that reduces the likelihood of entering the bad state, but at most one such corrective action can occur during the lifetime of the system. Costs are associated with each inspection, each false positive, the corrective action, and the entrance into the bad state. Dynamic programming is used to compute the minimum expected cost, which is a function of the age of the system. The optimal inspection schedule is readily derived from this value function. Computational examples are provided. This model is appropriate for medical screening or for a mission where there is only one spare part.     

Single machine parallel batch scheduling subject to precedence constraints

We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n²) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

An efficient SPH methodology for modelling mechanical characteristics of particulate composites

Particulate composites are one of the widely used materials in producing numerous state-of-the-art components in biomedical, automobile, aerospace including defence technology. Variety of modelling techniques have been adopted in the past to model mechanical behaviour of particulate composites. Due to their favourable properties, particle-based methods provide a convenient platform to model failure or fracture of these composites. Smooth particle hydrodynamics (SPH) is one of such methods which demonstrate excellent potential for modelling failure or fracture of particulate composites in a Lagrangian setting. One of the major challenges in using SPH method for modelling composite materials depends on accurate and efficient way to treat interface and boundary conditions. In this paper, a master-slave method based multi-freedom constraints is proposed to impose essential boundary conditions and interfacial displacement constraints in modelling mechanical behaviour of composite materials using SPH method. The proposed methodology enforces the above constraints more accurately and requires only smaller condition number for system stiffness matrix than the procedures based on typical penalty function approach. A minimum cut-off value-based error criteria is employed to improve the compu-tational efficiency of the proposed methodology. In addition, the proposed method is further enhanced by adopting a modified numerical interpolation scheme along the boundary to increase the accuracy and computational efficiency. The numerical examples demonstrate that the proposed master-slave approach yields better accuracy in enforcing displacement constraints and requires approximately the same computational time as that of penalty method.     

Influence of a liquid-filled compartment structure on the incoming shaped charge jet stability

Liquid-filled compartment structure consists of a bulk steel plate with matrix blind holes which are filled with liquid and a steel front plate to seal up the liquid with rings and bolts.The liquid-filled compart-ment structure can resist the shaped charge warhead effectively.This paper presents experimental and theoretical investigations of the penetration ability of the residual shaped charge jet emerging from the liquid-filled compartment structure after the penetration process at different impact angles.On the basis of shock wave propagation theory,the influence of the liquid-filled compartment structure on jet sta-bility is analysed.The interferences of the liquid backflow caused by a reflected shock wave and a back plate on jet stability under different impact angles are also examined.In addition,the range of the disturbed velocity segments of the jet at different impact angles and the penetration ability of the re-sidual jet are obtained.A theoretical model is validated against the experimental penetration depths.     

A note on circular error probabilities

An approximation for P(X² + Y² ≤ K²σ²₁) based on an unpublished result of Kleinecke is derived, where X and Y are independent normal variables having zero means and variances σ²₁ and σ²₂ and σ₁ ≥ σ₂. Also, we provide asymptotic expressions for the probabilities for large values of β = K²(1 - c²)/4c² where c = σ₂/σ₁. These are illustrated by comparing with values tabulated by Harter [6]. Solution of K for specified P and c is also considered. The main point of this note is that simple and easily calculable approximations for P and K can be developed and there is no need for numerical evaluation of integrals.     

Single-lane bridge serving two-lane traffic

This paper presents a mathematical model of a single-lane bridge serving two-way traffic in alternating directions (with an FIFO rule observed within each directional queue). While the bridge serves cars moving in one direction, cars approaching from the opposite direction wait in a queue at its foot. When cars in the current direction finish crossing the bridge, it begins serving cars from the other direction, if any are present. A newly-arrived car finding an empty bridge mounts it immediately. Several cars moving in the same direction may occupy the bridge simultaneously. The crossing speed is assumed to be constant, and the arrival processes in both directions are assumed to be independent, homogeneous Poisson processes. A generalization of the alternating-priority models [1, 2] is developed to arrive at the Laplace-Stieltjes transform and the expected value of the flow time (the time interval between the moments of arrival at the bridge and departure from it) for steady state conditions. The results are discussed and some examples are presented graphically.