Light weight HTPB-clay nanocomposites(HCN)with enhanced ablation performance as inhibition materials for composite propellant

In the present study,organically modified Montmorillonite clay with polar moiety,the Cloisite 30B,is used for preparation of Hydroxyl terminated polybutadiene(HTPB)-clay nanocomposites(HCN)by dispersion of nanoclay in polymer matrix under high shear mixing.The nanocomposites thus prepared are evaluated in composite propellants as inhibitor material for their functional utility.Several inhibition formulations containing 5 wt％-15 wt％of nanoclay,with or without the conventional filler Sb2O3,were prepared.All these formulations were evaluated for their physical,mechanical,thermal,and ablative properties.Ablation rate and density of the compositions containing Cloisite 30B is around 23％and 5％lower respectively in comparison of the base composition.Strain capability of these compositions is twofold higher than that of base composition.These compositions have also been evaluated for their smoke generation tendency by measuring infra red(IR)attenuation in the wavelength range 1.3 μm-5.6 μm and 8 μm-13 μm and thereby compared with the base composition.The corresponding results confirmed that the compositions containing Cloisite 30B as filler have much lower IR attenuation than compositions with conventional filler,Sb2O3.Replacement of 5％Sb2O3 by nanoclay showed 8％reduction in IR attenuation rate which further reduced to 16％on replacement of 15％of Sb2O3.Interfacial bonding of HCN based inhibitors is also comparable or even better than conventional inhibitors.Precisely,the nanoclay composites with Cloisite 30B as filler exhibit all desirable properties of an inhibitor.     

Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Opportunistic retooling of a flexible machine subject to failure

A set of jobs can be processed without interruption by a flexible machine only if the set of tools required by all jobs can be loaded in the tool magazine. However, in practice the total number of tools required by a job set would exceed the tool magazine capacity. In such situations, the job set has to be carefully partitioned at the start of the production run such that each partition can be processed without interruption. During the production run, if there are unscheduled machine downtimes due to machine failure, this provides an additional opportunity to optimally retool the magazine for a smaller job set consisting of just the unprocessed jobs. In this paper, we study job sequencing rules that allow us to minimize the total expected cost of machine down time due to machine failures and magazine retooling, assuming a dynamic re‐sequencing of the unprocessed jobs after each machine failure. Using these rules, we develop a branch‐and‐bound heuristic that allows us to solve problems of reasonable size. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 79–97, 2001     

Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

A practical organizational efficiency measure

There is often a call in any organization to make the system ‘more efficient’. This document describes a novel framework for measuring organizational efficiency at the microeconomic level. We show how this framework can be used to monitor an organization using data typically available in extant performance management frameworks. This is most useful in large organizations with eclectic outputs where resources may be too constrained to perform industry-level analyses, such as data envelope analysis, to infer efficiency. This method helps illuminate how the factors of an organization’s internal practices can affect its efficient use of resources.