首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   464篇
  免费   0篇
  464篇
  2021年   5篇
  2020年   5篇
  2019年   17篇
  2018年   14篇
  2017年   9篇
  2016年   12篇
  2015年   7篇
  2014年   11篇
  2013年   105篇
  2011年   10篇
  2010年   5篇
  2009年   7篇
  2008年   7篇
  2007年   8篇
  2006年   5篇
  2005年   8篇
  2004年   5篇
  2003年   5篇
  2002年   10篇
  2001年   7篇
  2000年   4篇
  1999年   5篇
  1997年   8篇
  1996年   5篇
  1995年   5篇
  1994年   9篇
  1993年   10篇
  1992年   7篇
  1991年   7篇
  1990年   4篇
  1989年   7篇
  1988年   14篇
  1987年   7篇
  1986年   7篇
  1985年   11篇
  1984年   9篇
  1983年   5篇
  1980年   5篇
  1979年   6篇
  1978年   5篇
  1977年   6篇
  1976年   3篇
  1974年   7篇
  1973年   4篇
  1972年   5篇
  1971年   8篇
  1970年   6篇
  1969年   5篇
  1968年   3篇
  1967年   3篇
排序方式: 共有464条查询结果,搜索用时 0 毫秒
351.
    
Developments within the UK in the Ministry of Defence’s policy on defence equipment acquisition demand changes in the scale and allocation of the Ministry’s budget for defence research. To facilitate the national debate on those changes, this paper reviews the key questions about UK defence research which the Ministry must resolve in order to implement its new Defence Technology Strategy.  相似文献   
352.
    
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
353.
    
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .  相似文献   
354.
Safe distances     
This work highlights the problem in military operations of setting safety limits for friendly forces, neutral forces, or civilians, to avoid sustaining unnecessary casualties both in wartime and in training. We present and investigate an analytic model which both enables the quantitative understanding of the inherent problems, and which furnishes a reasonably flexible tool in the hands of the analyst. Characteristic numerical results are displayed and analyzed: They show in particular that prevailing crude approximations are inadequate. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 259–269, 2001  相似文献   
355.
356.
We present a family of tests to detect the presence of a transient mean in a simulation process. These tests compare variance estimators from different parts of a simulation run, and are based on the methods of batch means and standardized time series. Our tests can be viewed as natural generalizations of some previously published work. We also include a power analysis of the new tests, as well as some illustrative examples. © 1994 John Wiley & Sons, Inc.  相似文献   
357.
A unified treatment is given for a class of discrete distributions derived by compounding a bivariate Poisson with a bivariate discrete or continuous distribution. Using generating functions a number of interesting results are obtained for probabilities, moments, cumulants, factorial moments, and factorial cumulants. Conditional distributions and regression functions are also examined. Five illustrative examples are presented in detail. © 1994 John Wiley & Sons, Inc.  相似文献   
358.
Book Reviews     
National Security Concepts of States: New Zealand. By Kennedy Graham. Taylor & Francis, London (1989), ISBN 0-8448-1614-0, £27.00

Power and Prestige in the British Army. By R.G. L. von Zugbach. Gower, Aldershot (1988), ISBN 0-566-05561-9, £22.50

The American Civil War and the Origins of Modern Warfare—Ideas, Organization, and Field Command. By Edward Hagerman. Indiana University Press, Bloomington, IN (1988), ISBN 0-253-30546-2, $37.50 (£23.29)

British Seapower and Procurement between the Wars: a Reappraisal of Rearmament. By G. A. H. Gordon. Macmillan, London (1988), ISBN 0-333-42332-1. £29.50

Armies in Low-intensity Conflict: a Comparative Analysis. Edited by David A. Charters and Maurice Tugwell. Brassey's Defence Publishers, London (1989), ISBN 0-08-036253-2, £25.00 ($45.00); Deadly Paradigms: the Failure of U.S. Counterinsurgency Policy. By Michael Shafer, Leicester University Press, Leicester (1988), ISBN 0-7185-1311-8, £28.00

British Defence Policy Striking the Right Balance. By J. Baylis. Macmillan, London (1989), ISBN 0-333-49133-5, £29.50 or £9.99  相似文献   
359.
Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001  相似文献   
360.
A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown that the solution for the illustrative problem is reasonably robust to rather large variations in the measure of value. We cannot, however, conclude that this would be the case in general. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 18–40, 2001  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号