The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

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.     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

Mechanical properties and thermal conductivity of pristine andfunctionalized carbon nanotube reinforced metallic glass composites:A molecular dynamics approach

This work uses the molecular dynamics approach to study the effects of functionalization of carbon nanotubes (CNTs) on the mechanical properties of Cu64Zr36 metallic glass (MG). Three types of functional groups, carboxylic, vinyl and ester were used. The effect of CNT volume fraction (Vf) and the number of functional groups attached to CNT, on the mechanical properties and thermal conductivity of CNT-MG composites was analysed using Biovia Materials Studio. At lower values of Vf (from 0 to 5％), the per-centage increase in Young's modulus was approximately 66％. As the value of Vf was increased further (from 5 to 12％), the rate of increase in Young's modulus was reduced to 16％. The thermal conductivity was found to increase from 1.52 W/mK at Vf=0％to 5.88 W/mK at Vf=12％, thus giving an increase of approximately 286％. Functionalization of SWCNT reduced the thermal conductivity of the SWCNT-MG composites.     

Damage modeling of ballistic penetration and impact behavior of concrete panel under low and high velocities

This work presents a numerical simulation of ballistic penetration and high velocity impact behavior of plain and reinforced concrete panels. This paper is divided into two parts. The first part consists of numerical modeling of reinforced concrete panel penetrated with a spherical projectile using concrete damage plasticity (CDP) model, while the second part focuses on the comparison of CDP model and Johnson-Holmquist-2 (JH-2) damage model and their ability to describe the behavior of concrete panel under impact loads. The first and second concrete panels have dimensions of 1500 mm × 1500 mm × 150 mm and 675 mm × 675 mm × 200 mm, respectively, and are meshed using 8-node hexahedron solid elements. The impact object used in the first part is a spherical projectile of 150 mm diameter, while in the second part steel projectile of a length of 152 mm is modeled as rigid element. Failure and scabbing characteristics are studied in the first part. In the second part, the com-parison results are presented as damage contours, kinetic energy of projectile and internal energy of the concrete. The results revealed a severe fracture of the panel and high kinetic energy of the projectile using CDP model comparing to the JH-2 model. In addition, the internal energy of concrete using CDP model was found to be less comparing to the JH-2 model.     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimization and mediated bartering models for ground delay programs

The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

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.     

How the End Begins: The Road to a Nuclear World War III

Ron Rosenbaum, How the End Begins: The Road to a Nuclear World War III. Simon & Schuster, 2011. 305 pages, $28.