A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Spaghetti: systems thinking and the US Army

In the mid-2000s, the United States Army was embroiled in counterinsurgency missions in Iraq and Afghanistan that required deeper understanding of local social systems. The Army turned to systems thinking and design thinking to model and understand the world, define problems, and develop approaches to strategic and operational challenges. However, the Army’s approach as expressed in publications and doctrine encourages the development of complicated, unsupported, and unfalsifiable hypotheses. The risk is that the Army will act on incorrect assumptions and develop plans that are fragile.     

有交易费的套期保值未定权益的最小债券价值量

讨论带交易费的多种股票的市场模型中未定权益的套期保值定价问题,提出折算函数作为总资产的一种较为合理的衡量方式,并来刻画套期保值策略,从而,利用鞅方法和折算函数的性质,得到带交易费套期保值未定权益的最小债券价值量结果。     

THE ‘PRICE’ OF TERRORISM

Security measures are said to increase the price of terrorism. This price has not been hitherto defined in an economically meaningful way. This paper provides a precise definition by treating the terrorists’ resource endowment as a parcel of contingent claims to political influence with a price equal to the summed value of those contingent claims in potential states of the world. Equipped with this definition, an equilibrium model of the price of terrorism is deployed. Important insights are gained into the effect of terrorists’ risk aversion at the level of the price of terrorism in different states of the world and the theoretical conclusion is reached that higher security is associated with a lower price of terrorism rather than a higher price. The implications for policy are discussed.     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A location‐inventory model with lateral transshipments

We study an infinite horizon periodic stochastic inventory system consisting of retail outlets and customers located on a homogenous line segment. In each period, the total demand, generated by the customers on the line, is normally distributed. To better match supply and demand, we incorporate lateral transshipments. We propose a compact model in which the strategic decisions—the number and locations of retail outlets—are determined simultaneously with the operational decisions—the inventory replenishment and transshipment quantities. We find the optimal balance between the risk‐pooling considerations, which drive down the optimal number of retail outlets, and lateral transshipments, which drive up the optimal number of retail outlets. We also explore the sensitivity of the optimal number of retail outlets to various problem parameters. This article presents a novel way of integrating lateral transshipments in the context of an inventory‐location model. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

带交易费的市场模型和未定权益套期保值

给出了有交易费的且多种股票参与交易的市场模型,并且讨论在此市场模型下的未定权益套期保值问题,在这一模型中,假定仅债券与股票之间有交易,而不同股票之间不直接进行交易以及交易费率是常数。     

Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition

In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc.     

Pareto-optimality in classical inventory problems

In this paper the inventory problem with backorders both deterministic and stochastic is studied using trade-off analysis in the context of vector optimization theory. The set of Pareto-optimal solutions is geometrically characterized in both the constrained and unconstrained cases. Moreover, a new way of utilizing Pareto-optimality concepts to handle classical inventory problems with backorders is derived. A new analysis of these models is done by means of a trade-off analysis. New solutions are shown, and an error bound for total inventory cost is provided. Other models such as multi-item or stochastic lead-time demand inventory problems are addressed and their Pareto-optimal solution sets are obtained. An example is included showing the additional applicability of this kind of analysis to handle parametric problems. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 83–98, 1998     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

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.     

Predictability of operational processes over finite horizon

Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The Obama administration's phased-adaptive architecture: technological,operational and political issues

In 2009, the Obama administration announced a new missile defense strategy, termed a phased-adaptive architecture (PAA) focused primarily on countering the growing threat from theater ballistic missiles. The success of this strategy is predicated on the rapid development and fielding of successive increments of defensive capability in a manner adapted to the specific requirements for missile defenses in different regions of the world. The administration is committed to building a European regional missile defense system, the European PAA or EPAA between now and 2020. The first elements of the EPAA were deployed in late 2011. However, much progress is still required in order to reach the goals set for the PAA. This article addresses the technological, operational and political issues confronting the Obama administration in its efforts to make the PAA a reality.     

Heuristic scheduling of resource-constrained projects with cash flows

Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997     

基于威布尔比例故障率模型的装备检测间隔期多属性模糊决策方法

在对威布尔比例故障率模型进行研究的基础上,以可接受的故障风险为约束,计算了装备的检测间隔期。由于装备使用受到故障风险、检测费用、可用度及停机时间等多属性影响,运用基于加权投影折中法建立了模糊多属性状态检测周期决策模型,实现了多因素条件下状态检测间隔期的综合优化决策。最后,通过实例分析验证了该模型的适用性。     

基于复杂网络的“云作战”体系模型及仿真

根据现代作战循环理论，用复杂网络的方法把作战体系的各种作战单元抽象为节点，将节点之间相互关系抽象为节点间的边，制定作战体系模型的构建规则，分别构建传统作战体系模型和“云作战”体系模型，提出作战体系度量指标，并进行仿真分析，对比两种作战体系作战能力和抗毁能力。     

Disruption‐management strategies for short life‐cycle products

Supplier diversification, contingent sourcing, and demand switching (whereby a firm shifts customers to a different product if their preferred product is unavailable), are key building blocks of a disruption‐management strategy for firms that sell multiple products over a single season. In this article, we evaluate 12 possible disruption‐management strategies (combinations of the basic building‐block tactics) in the context of a two‐product newsvendor. We investigate the influence of nine attributes of the firm, its supplier(s), and its products on the firs preference for the various strategies. These attributes include supplier reliability, supplier failure correlation, payment responsibility in the event of a supply failure, product contribution margin, product substitutability, demand uncertainties and correlation, and the decision makes risk aversion. Our results show that contingent sourcing is preferred to supplier diversification as the supply risk (failure probability) increases, but diversification is preferred to contingent sourcing as the demand risk (demand uncertainty) increases. We find that demand switching is not effective at managing supply risk if the products are sourced from the same set of suppliers. Demand switching is effective at managing demand risk and so can be preferred to the other tactics if supply risk is low. Risk aversion makes contingent sourcing preferable over a wider set of supply and demand‐risk combinations. We also find a two‐tactic strategy provides almost the same benefit as a three‐tactic strategy for most reasonable supply and demand‐risk combinations. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015