Investigating the surface integrity of aluminium based composites machined by EDM

In the present work, the surface characteristics of Electrical Discharge Machined (EDM) Al (6351)SiC and Al (6351)SiCB₄C composites are investigated. The composites are prepared by employing the conventional stir casting technique, as it can produce better particle dispersion in the matrix. The detailed experimental study is performed on the composites by varying current (I), duty factor (τ), pulse on time (T_on), and the gap voltage (V) in order to analyze the Heat Affected Zone (HAZ) formed in the sub surface and the average crater diameter formed on the machined surface of the composites as an output function. The formation of recast layers, presence of bubbles and the surface texture of the composites at various machining conditions are observed. The results show that the increased Metal Removal Rate (MRR) increases the depth of HAZ and the average crater diameter on the machined area. Further, the addition of B₄C particles to the composite produces more surface defect than the AlSiC composite.     

Cell structure of microcellular combustible object foamed by supercritical carbon dioxide

In order to solve the issue that the combustible objects for cased telescoped ammunition (CTA) didn't burn completely during the combustion process, the microcellular combustible objects were foamed with numerous cells in the micron order to improve the combustion performance by the supercritical carbon dioxide (SCCO₂) foaming technology. As the cell structure determined the combustion properties of microcellular combustible objects, the solubility of SCCO₂ dissolved into the combustible objects was obtained from the gravimetric method, and scanning electron microscope (SEM) was applied to characterize the cell structure under various process conditions of solubility, foaming temperature and foaming time. SEM images indicate that the cell diameter of microcellular combustible objects is in the level of 1 μm and the cell density is about 10¹¹ cell⋅cm⁻³. The microcellular combustible objects fabricated by the SCCO₂ foaming technology are smooth and uniform, and the high specific surface area of cell structure can lead to the significant combustion performance of microcellular combustible object for CTA in the future.     

Heavy metal free primers: Polymorphism of gadolinium and titanium in the context of GSR glass phase

The possibility of identifying gunshot residue (GSR) particles produced by non-toxic primers containing only titanium and zinc is a very difficult task using SEM/EDX analysis employed in the analysis of GSR originating from primers containing lead, barium and antimony. However, Bauer et al. demonstrated that non-toxic (TiZn) primers form a TiZn₂O₄ spinel crystalline structure using SEM/EDX with EBSD (Electron Back Scatter Diffraction) and TKD (Transmission Kikuchi Diffraction), whereas GSR originating from gadolinium-doped TiZn primers form a non-crystalline glass phase. Here, a possible explanation of these different phenomena is hypothesized.     

Optimizing the defensive characteristics of mild steel via the electrodeposition of ZnSi3N4 reinforcing particles

The effect of ZnSi₃N₄ deposition prepared via direct electrolytic co-deposition on mild steel was studied as a result its inherent vulnerability to corrosion in an aggressive environment and failure on the application of load. The experiment was conducted varying the mass concentration of silicon nitride (Si₃N₄) between 7 and 13 g at cell voltage of 0.3 and 0.5 V, at constant temperature of 45 °C. The morphologies of the coated surfaces were characterized using high resolution Nikon Optical Microscope and Scanning Electron Microscope (SEM) revealing that the particles of the ZnSi₃N₄ were homogeneously dispersed. The corrosion behaviour was studied using potentiodynamic polarization technique in 3.65% NaCl solution and the microhardness was examined using Brinell hardness testing technique. The result of the corrosion experiment confirmed an improved corrosion resistance with a reduction in corrosion rate from 9.7425 mm/year to 0.10847 mm/year, maximum coating efficiency of 98.9%, maximum polarization resistance of 1555.3 Ω and a very low current density of 9.33 × 10⁻⁶ A/cm². The negative shift in the E_corr revealed the cathodic protective nature of the coating. The microhardness was also found to have increased from 137.9 HBN for the unmodified steel to a maximum value of 263.3 HBN for the 0.5Zn13Si₃N₄ coated steel representing 90.9% increment in hardness as a result of the matrix grain refining and dispersion-strengthening ability of the incorporated Si₃N₄ particles.     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Estimating component characteristics from system failure‐time data

Suppose that failure times are available from a random sample of N systems of a given, fixed design with components which have i.i.d. lifetimes distributed according to a common distribution F. The inverse problem of estimating F from data on observed system lifetimes is considered. Using the known relationship between the system and component lifetime distributions via signature and domination theory, the nonparametric maximum likelihood estimator _N(t) of the component survival function (t) is identified and shown to be accessible numerically in any application of interest. The asymptotic distribution of _N(t) is also identified, facilitating the construction of approximate confidence intervals for (t) for N sufficiently large. Simulation results for samples of size N = 50 and N = 100 for a collection of five parametric lifetime models demonstrate the utility of the recommended estimator. Possible extensions beyond the i.i.d. framework are discussed in the concluding section. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Inventory policies for a make‐to‐order system with a perishable component and fixed ordering cost

We consider a make‐to‐order production system where two major components, one nonperishable (referred to as part 1) and one perishable (part 2), are needed to fulfill a customer order. In each period, replenishment decisions for both parts need to be made jointly before demand is realized and a fixed ordering cost is incurred for the nonperishable part. We show that a simple (s_n,S,S) policy is optimal. Under this policy, S along with the number of backorders at the beginning of a period if any and the availability of the nonperishable part (part 1) determines the optimal order quantity of the perishable part (part 2), while (s_n,S) guide when and how much of part 1 to order at each state. Numerical study demonstrates that the benefits of using the joint replenishment policy can be substantial, especially when the unit costs are high and/or the profit margin is low. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

Nitro-tetrazole based high performing explosives: Recent overview of synthesis and energetic properties

Heterocyclic skeleton (Azoles) and different energetic groups containing high performing explosives are highly emerged in recent years to meet the challenging requirements of energetic materials in both military and civilian applications with improved performance. For this purpose tetrazole (Azole) is identified as an attractive heterocyclic backbone with energetic functional groups nitro (-NO₂), nitrato (-ONO₂), nitrimino (-NNO₂), and nitramino (–NH–NO₂) to replace the traditionally used high performing explosives. The tetrazole based compounds having these energetic functional groups demonstrated advanced energetic performance (detonation velocity and pressure), densities, and heat of formation (HOF) and became a potential replacement of traditional energetic compounds such as RDX. This review presents a summary of the recently reported nitro-tetrazole energetic compounds containing poly-nitro, di/mono-nitro, nitrato/nitramino/nitrimino, bridged/bis/di tetrazole and nitro functional groups, describing their preparation methods, advance energetic properties, and further applications as high-performing explosives, especially those reported in the last decade. This review aims to provide a fresh concept for designing nitro-tetrazole based high performing explosives together with major challenges and perspectives.     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

Scheduling multiple products on parallel machines with setup costs

We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time p_i to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of n_i units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Asymptotic analysis of periodic policies for the inventory routing problem

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

Structure design and property adjustment of new cage rich-nitrogen pentazolyltetraazacubanes as potential high energy density compounds

In this study, based on two attractive energetic compounds pentazole (PZ) and tetraazacubane (TAC), a new family of high energy and high nitrogen compounds pentazolyltetraazacubanes were designed. Then, a different number of NH₂ or NO₂ groups were introduced into the system to further adjust the property. The structures, properties, and the structure-property relationship of designed molecules were investigated theoretically. The results showed that all nine designed compounds have extremely high heat of formation (HOF, 1226-2734 kJ/mol), good density (1.73–1.88 g/cm³), high detonation velocity (8.30–9.35 km/s), high detonation pressure (29.8–39.7 GPa) and acceptable sensitivity (ΔV: 41-87 ų). These properties could be effectively positive adjusted by replacing one or two PZ rings by NH₂ or/and NO₂ groups, especially for the energy and sensitivity performance, which were increased and decreased obviously, respectively. As a result, two designed pentazolyltetraazacubanes were predicted to have higher energy and lower sensitivity than the famous high energy compound in use 1,3,5,7-tetranitro-1,3,5,7-tetraazacyclooctane, while two others have better combination property than 1,3,5-Trinitro-1,3,5-triazacyclohexane. In all, four new pentazolyltetraazacubanes with good combination performance were successfully designed by combining PZ with TAC, and the further property adjustment strategy of introducing a suitable amount of NH₂/NO₂ groups into the system. This work may help develop new cage energetic compounds.     

Confidence intervals for ranked means

Suppose that observations from populations π₁, …, π_k (k ≥ 1) are normally distributed with unknown means μ₁., μ_k, respectively, and a common known variance σ². Let μ_[1] μ … ≤ μ_[k] denote the ranked means. We take n independent observations from each population, denote the sample mean of the n observation from π₁ by X _i (i = 1, …, k), and define the ranked sample means X _[1] ≤ … ≤ X _[k]. The problem of confidence interval estimation of μ₍₁₎, …,μ_[k] is stated and related to previous work (Section 1). The following results are obtained (Section 2). For i = 1, …, k and any γ(0 < γ < 1) an upper confidence interval for μ_[i] with minimal probability of coverage γ is (? ∞, X _[i]+ h) with h = (σ/n^1/2) Φ^?1(γ^1/k-i+1), where Φ(·) is the standard normal cdf. A lower confidence interval for μ_[i] with minimal probability of coverage γ is (X _i[i] – g, + ∞) with g = (σ/n^1/2) Φ^?1(γ^1/i). For the upper confidence interval on μ_[i] the maximal probability of coverage is 1– [1 – γ^1/k-i+1]ⁱ, while for the lower confidence interval on μ_[i] the maximal probability of coverage is 1–[1– γ^1/i] ^k-i+¹. Thus the maximal overprotection can always be calculated. The overprotection is tabled for k = 2, 3. These results extend to certain translation parameter families. It is proven that, under a bounded completeness condition, a monotone upper confidence interval h(X ₁, …, X _k) for μ_[i] with probability of coverage γ(0 < γ < 1) for all μ = (μ_[1], …,μ_[k]), does not exist.     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014     

Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models

In this article, we study a biobjective economic lot‐sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot‐sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot‐sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an ‐hard task in general. Finally, we shed some light on the task of describing the Pareto frontier. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014     

On online bin packing with LIB constraints

In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the condition above. This variant is called online bin packing problem with LIB (larger item in the bottom) constraints. We give an improved analysis of First Fit showing that its competitive ratio is at most , and design a lower bound of 2 on the competitive ratio of any online algorithm. In addition, we study the competitive ratio of First Fit as a function of an upper bound (where d is a positive integer) on the item sizes. Our upper bound on the competitive ratio of First Fit tends to 2 as d grows, whereas the lower bound of two holds for any value of d. Finally, we consider several natural and well known algorithms, namely, Best Fit, Worst Fit, Almost Worst Fit, and Harmonic, and show that none of them has a finite competitive ratio for the problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009