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     

Multiproduct dynamic lot-sizing model with coordinated replenishments

In this article we consider a multiproduct dynamic lot-sizing model. In addition to a separate setup cost for each product ordered, a joint setup cost is incurred when at least one product is ordered. We formulate the model as a concave minimization problem over a compact polyhedral set and present a finite branch and bound algorithm for finding an optimal ordering schedule. Superiority of the branch and bound algorithm to the existing exact procedures is demonstrated. We report computational experience with problems whose dimensions render the existing procedures computationally infeasible.     

Visibility probabilities on line segments in three-dimensional spaces subject to random poisson fields of obscuring spheres

The methodology of determining simultaneous visibility probabilities and points on line segments is extended to problems of three-dimensional spaces, with Poisson random fields of obscuring spheres. Required functions are derived analytically and a numerical example is given for a special case of a standard Poisson field, with uniform distribution of sphere diameters.     

A general age replacement model with minimal repair

A general age replacement is introduced which incorporates minimal repair, planned and unplanned replacements, and costs which depend on time. Finite and infinite horizon results are obtained. Various special cases are considered. Furthermore, a shock model with general cost structure is considered.     

Note: Optimal allocation of resources to nodes of series systems with respect to failure-rate ordering

Allocation of spare components in a system in order to optimize the lifetime of the system with respect to a suitable criterion is of considerable interest in reliability, engineering, industry, and defense. We consider the problem of allocation of K active spares to a series system of independent and identical components in order to optimize the failure-rate function of the system. © 1997 John Wiley & Sons, Inc.     

What is the global landpower network and what value might it provide?

US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives.     

Employment and utilization of engineers among defense contractors

Defense contractors retain engineers for two reasons. First, engineers work on current-period production contracts. Second, engineers conduct independent research and development (IR&D) and write bids and proposals (B&P) for future contracts. The amount of IR&D/B&P activity, however, understates the amount of effort devoted to learning that reduces the cost of future production. Even some engineers who work on current-period production may engage in learning, as a by-product of their efforts. This article develops and implements a model for estimating the volume of learning activity undertaken by four large manufacturers of military aircraft. © 1994 John Wiley & Sons, Inc.     

WHO IS THE ENEMY?

We examine who benefits when there is a strong leader in place, and who benefits when a situation lacks a proper leader. There are fractious terrorist groups who seek to serve the same people in common cause against a common enemy. The groups compete for rents obtained from the public by engaging in actions against the common enemy. We determine the leadership structure under which each group is better off, as well as the circumstance that the common enemy prefers. We are able to state simple and general conditions for each group and the common enemy to benefit.