Aid versus sanctions for taming oppressors: theory and case study of the Iraqi Kurds

We model an oppressor aiming at victimizing an excluded group in his country, with two main variants. A foreign power affects his behaviour using either conditional aid, subject to the dictator’s participation constraint, or the threat of sanctions, broadly defined, subject to the credibility constraint. The choice between the two is either determined by the latter, or by their relative cost. Aid is preferred when the threat of sanctions is ineffective, and sanctions are too expensive. Sanctions might be imposed, if the threat is ineffective. A case study of the Iraqi Kurds after Iraq was subject to sanctions is presented.     

Military expenditure and economic growth: peru 1970–1996

The present study examines the effects of military expenditure on growth in Peru in the period from 1970 to 1996. By using a Deger‐type Simultaneous Equations Model it is possible to break up the net effect into supply‐ and demand‐side influences. The former consist of positive externalities of defence activities on the other sectors of the economy, while the latter can be described as crowding‐out of civilian investment. Estimations find the supply‐side effects to be insignificantly different from zero, while the crowding‐out effect of defence spending is significant and substantial. It is thereby established that defence expenditure has a negative overall effect on economic growth in Peru. Although several caveats – including specification problems of the Deger model, the quality of the data used, a relatively small sample and the presence of autocorrelation in the estimations – must be considered, these results turn out to be quite robust with respect to estimation methods (3SLS, 2SLS, OLS) and slight modifications to the model. They are also consistent with previous empirical findings from other countries and cross sectional studies.     

Resourcing for defense: Solving the roles and missions puzzle

One of the most important issues facing the post‐Cold War U.S. defense establishment concerns the future allocation of combat tasks and responsibilities among different branches of the armed forces. The challenge is to reduce unnecessary redundancy across roles and missions when resources are highly constrained, without compromising military effectiveness. Defining the policy problem as one of resource allocation rather than operational effectiveness, we develop a methodology for allocating roles and missions. Our methodology focuses at the highest level of force aggregation and uses a mathematical programming model to produce cross‐service cross‐mission trade‐offs that will yield the best total force combat and non‐combat potential within resource consumption constraints.     

Coordination mechanisms for a three‐stage reverse supply chain to increase profitable returns

In this article, we consider a generic electronic product that can be remanufactured or recycled at the end of its life cycle to generate new profit. We first describe the product return process and then present a customer segmentation model to capture consumers' different behaviors with respect to product return so that the retailer can work more effectively to increase the return volume. In regard to the collaboration between the retailer and the manufacturer, we explore a revenue‐sharing coordination mechanism for achieving a win‐win outcome. The optimality and sensitivity of the critical parameters in four strategies are obtained and examined both theoretically and numerically, which generate insights on how to manage an efficient consumer‐retailer‐manufacturer reverse supply chain, as well as on the feasibility of simplifying such a three‐stage chain structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Waypoint analysis for command and control

Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

储油状况下油罐底板探漏方法比较

比较了开罐检漏、传统检漏和带油检漏方法的优缺点,得出储油状况下油罐检漏技术的重要性,指出油罐底板检漏一直是油罐检漏的热点和难点。为找到适合覆土油罐和洞库油罐特点的油罐底板探漏方法,简要介绍了目前国内外油罐底板主要探漏方法,着重说明了各种方法的探漏原理、探漏精度和定位功能。分析对比了各种探漏方法的优缺点,并在此基础上针对改造和新建油库的油罐底板探漏方法提出合理化建议,为现阶段油库的扩容改造提供有益借鉴。     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

教考结合 教学相长——公关文秘专业考核方式改革初探

本文论述了公关文秘专业深化改革考核方法的指导思想、具体做法、配套措施和实施效果。结合具体课程重点阐述了案例讨论、情景模拟、实地调查、卷面考试等多种方式结合的考核方法