Xiaohu Li  Ming J. Zuo 《海军后勤学研究》2004,51(3):332-344

It is shown, in this note, that the right spread order and the increasing convex order are both preserved under the taking of random maxima, and the total time on test transform order and the increasing concave order are preserved under the taking of random minima. Some inequalities and preservation properties in reliability and economics are given as applications. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   

    

Moustafa Elshafei  Hanif D. Sherali  J. Cole Smith 《海军后勤学研究》2004,51(1):72-94

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   

    

M.A. Kubzin  V.A. Strusevich  J. Breit  G. Schmidt 《海军后勤学研究》2006,53(1):16-23

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   

    

Thomas G. Yeung  Scott J. Mason 《海军后勤学研究》2006,53(4):285-297

The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   

    

Anand Paul  Asoo J. Vakharia 《海军后勤学研究》2006,53(5):418-431

The focus of this paper is on determining the requirements of different component options of a modular end‐product in an uncertain environment. We explicitly model two distinct sources of uncertainty: stochastic end‐product demand and unknown market proportions for the different product options available. Our cost minimizing model focuses on determining the optimal requirements policies for component options that meet a pre‐set service level. We show that simple common‐sense requirements policies are not generally optimal; there is a non‐linear connection between service level and component requirements that is hard to characterize without a detailed analysis. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   

    

James V. Jucker  Meir J. Rosenblatt 《海军后勤学研究》1985,32(4):537-550

Quantity discounts are considered in the context of the single-period inventory model known as “the newsboy problem.” It is argued that the behavioral implications of the all-units discount schedule are more complex and interesting than the literature has suggested. Consideration of this behavior and the use of marginal analysis lead to a new method for solving this problem that is both conceptually simpler and more efficient than the traditional approach. This marginal-cost solution procedure is described graphically, an algorithm is presented, and an example is used to demonstrate that this solution procedure can be extended easily to handle complex discount schedules, such as some combined (simultaneously applied) purchasing and transportation cost discount schedules.  相似文献   

The neglected dimension: Controlling cruise missile proliferation     

Dennis M. Gormley 《The Nonproliferation Review》2013,20(2):21-29

  相似文献   

Editorial     

John J. Mulhern 《Defense & Security Analysis》1993,9(1):1-9

  相似文献   

Proposals for joint chiefs of staff reorganization     

Edward B. Davis  Sheila M. Davis 《Defense & Security Analysis》1986,2(2):85-99

  相似文献   

Peace dividend in Germany; a cost-benefit assessment     

Burkhardt J. Huck 《Defense & Security Analysis》1994,10(2):157-164

  相似文献