Numerical simulation of warhead transportation

The new numerical approach for analysis of the warhead transportations is suggested.This approach allows to control the warhead operability before its experimental analysis.The approach is implemented by the adequate models for the software ANSYS.Analysis of the loads at land operations and trans-portations of the warhead by natural roads,water and aviation allows to obtain the maximal values of loads,which are used in numerical simulations of the warhead.These loads give an opportunity to analyze the operability and the fatigue strength of the cartridge warhead.The numerical simulations of the attachments of the warhead combat elements are performed on the basis of the suggested method.The data of the numerical simulations verifies the operability of the fastener system of the warhead combat elements.     

Heart analytics: Analytical modeling of cardiovascular care

Cardiovascular diseases (CVDs) are the leading cause of death and disability both in the United States and worldwide. Despite high morbidity, mortality, and cost in the United States and global healthcare systems, cardiovascular care has been understudied in the healthcare operations management literature. In this paper, we identify research opportunities for healthcare operations management scholars to aid in improving cardiovascular care. We focus on three burdensome conditions, including (1) coronary artery disease, (2) stroke, and (3) heart failure, which, collectively, lead to the vast majority of CVD‐caused mortality and disability. For each condition, we characterize a typical patient's journey in receiving cardiovascular care, elucidating key challenges in improving care and outlining research questions for healthcare operations management scholars. We close with a reference to new research opportunities that emerge as artificial intelligence is likely to transform much of cardiovascular care.     

The impact of manufacturer rebates on supply chain profits

Manufacturer rebates are commonly used as price discount tools for attracting end customers. In this study, we consider a two‐stage supply chain with a manufacturer and a retailer, where a single seasonal product faces uncertain and price‐sensitive demand. We characterize the impact of a manufacturer rebate on the expected profits of both the manufacturer and the retailer. We show that unless all of the customers claim the rebate, the rebate always benefits the manufacturer. Our results thus imply that “mail‐in rebates,” where some customers end up not claiming the rebate, particularly when the size of the rebate is relatively small, always benefit the manufacturer. On the other hand, an “instant rebate,” such as the one offered in the automotive industry where every customer redeems the rebate on the spot when he/she purchases a car, does not necessarily benefit the manufacturer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A supply chain design model with unreliable supply

Uncertainties abound within a supply chain and have big impacts on its performance. We propose an integrated model for a three‐tiered supply chain network with one supplier, one or more facilities and retailers. This model takes into consideration the unreliable aspects of a supply chain. The properties of the optimal solution to the model are analyzed to reveal the impacts of supply uncertainty on supply chain design decisions. We also propose a general solution algorithm for this model. Computational experience is presented and discussed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

An economic lot‐sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis

The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Single- and multiple-processor models for minimizing completion time variance

This article concerns the scheduling of n jobs around a common due date, so as to minimize the average total earliness plus total lateness of the jobs. Optimality conditions for the problem are developed, based on its equivalence to an easy scheduling problem. It seems that this problem inherently has a huge number of optimal solutions and an algorithm is developed to find many of them. The model is extended to allow for the availability of multiple parallel processors and an efficient algorithm is developed for that problem. In this more general case also, the algorithm permits great flexibility in finding an optimal schedule.