Interval scheduling: A survey

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Bayesian strategies for dynamic pricing in e‐commerce

E‐commerce platforms afford retailers unprecedented visibility into customer purchase behavior and provide an environment in which prices can be updated quickly and cheaply in response to changing market conditions. This study investigates dynamic pricing strategies for maximizing revenue in an Internet retail channel by actively learning customers' demand response to price. A general methodology is proposed for dynamically pricing information goods, as well as other nonperishable products for which inventory levels are not an essential consideration in pricing. A Bayesian model of demand uncertainty involving the Dirichlet distribution or a mixture of such distributions as a prior captures a wide range of beliefs about customer demand. We provide both analytic formulas and efficient approximation methods for updating these prior distributions after sales data have been observed. We then investigate several strategies for sequential pricing based on index functions that consider both the potential revenue and the information value of selecting prices. These strategies require a manageable amount of computation, are robust to many types of prior misspecification, and yield high revenues compared to static pricing and passive learning approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Multidirectional scheduling scheme in resource‐constrained project schedulingproblem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014     

Critics gone wild: Counterinsurgency as the root of all evil

The Western interventions in Iraq and Afghanistan have produced a heated polemic concerning the merits and demerits of counterinsurgency – the operational approach underpinning both campaigns. The two books reviewed here provide a good summation of the arguments against counterinsurgency: it is not a strategy and will fail when mistaken as such; its theory does not make intervention and war significantly easier; and even the most successful counterinsurgency campaigns have been bloody, violent, and protracted. Yet as this review highlights, beyond these central points, criticism of counterinsurgency is too often off the mark in its approach and totalizing in its pretentions. There is much to criticize and an urgent need to learn from past campaigns, yet bold claims and broad generalizations can mislead rather than enlighten. The analysis is particularly unhelpful when the definition of the central issue at hand – counterinsurgency – is being unwittingly or deliberately distorted. In the end, these two books form a poor basis for the debate that must now take place, because they are too ideological in tone, too undisciplined in approach, and therefore too unqualified in what they finally say.     

Influence of porosity distribution on nonlinear free vibration and transient responses of porous functionally graded skew plates

This article deals with the investigation of the effects of porosity distributions on nonlinear free vibration and transient analysis of porous functionally graded skew (PFGS) plates. The effective material properties of the PFGS plates are obtained from the modified power-law equations in which gradation varies through the thickness of the PFGS plate. A nonlinear finite element (FE) formulation for the overall PFGS plate is derived by adopting first-order shear deformation theory (FSDT) in conjunction with von Karman’s nonlinear strain displacement relations. The governing equations of the PFGS plate are derived using the principle of virtual work. The direct iterative method and Newmark’s integration technique are espoused to solve nonlinear mathematical relations. The influences of the porosity distributions and porosity parameter indices on the nonlinear frequency responses of the PFGS plate for different skew angles are studied in various parameters. The effects of volume fraction grading index and skew angle on the plate’s nonlinear dynamic responses for various porosity distributions are illustrated in detail.     

The role of covariate balance in observational studies

Observational data are prevalent in many fields of research, and it is desirable to use this data to make causal inferences. Because this data is nonrandom, additional assumptions are needed in order to construct unbiased estimators for causal effects. The standard assumption is strong ignorability, though it is often impossible to achieve the level of covariate balance that it requires. As such, researchers often settle for lesser balance levels within their datasets. However, these balance levels are generally insufficient to guarantee an unbiased estimate of the treatment effect without further assumptions. This article presents several extensions to the strong ignorability assumption that address this issue. Under these additional assumptions, specific levels of covariate balance are both necessary and sufficient for the treatment effect estimate to be unbiased. There is a trade‐off, however: as balance decreases, stronger assumptions are required to guarantee estimator unbiasedness. These results unify parametric and nonparametric adjustment methods for causal inference and are actualized by the Balance Optimization Subset Selection framework, which identifies the best level of balance that can be achieved within a dataset. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 323–344, 2017