首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   468篇
  免费   15篇
  2021年   4篇
  2020年   4篇
  2019年   8篇
  2018年   5篇
  2017年   9篇
  2016年   9篇
  2015年   8篇
  2014年   9篇
  2013年   99篇
  2011年   5篇
  2009年   4篇
  2007年   7篇
  2005年   6篇
  2004年   8篇
  2003年   6篇
  2002年   8篇
  2001年   7篇
  2000年   4篇
  1999年   7篇
  1998年   10篇
  1997年   11篇
  1996年   8篇
  1995年   12篇
  1994年   13篇
  1993年   12篇
  1992年   12篇
  1991年   14篇
  1990年   6篇
  1989年   4篇
  1988年   8篇
  1987年   9篇
  1986年   4篇
  1985年   9篇
  1984年   9篇
  1983年   6篇
  1982年   6篇
  1981年   9篇
  1980年   9篇
  1979年   11篇
  1978年   7篇
  1977年   5篇
  1976年   7篇
  1975年   8篇
  1974年   7篇
  1973年   8篇
  1972年   8篇
  1971年   6篇
  1969年   6篇
  1968年   5篇
  1967年   4篇
排序方式: 共有483条查询结果,搜索用时 15 毫秒
321.
322.
323.
324.
This paper deals with the problem of finding the optimal dynamic operating policy for an M/M/S queue. The system is observed periodically, and at the beginning of each period the system controller selects the number of service units to be kept open during that period. The optimality criterion used is the total discounted cost over a finite horizon.  相似文献   
325.
In this analysis we extend the theory of stochastic duels to include the situation where one of the contestants fires a single infinitely long burst at a fixed rate of fire and secondly where he fires fixed-length, fixed-rate of fire bursts randomly spaced. In both cases the opponent fires single rounds randomly spaced. Special cases and parameter effects are considered.  相似文献   
326.
This work is concerned primarily with presenting techniques for constructing bimatrix games with predetermined equilibrium points. Some partial results on Nash-solvability are also given.  相似文献   
327.
Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0.  相似文献   
328.
A review of univariate tolerance intervals is presented from an application-oriented point of view. Both β-content and β-expectation intervals are defined and considered. Standard problems are discussed for the distribution-free case and with various distributional assumptions (normal, gamma, Poisson) which occur most frequently in practice. The determination of sample size is emphasized. A number of examples are used to illustrate the types of problems which permit solutions with the excellent tables now available.  相似文献   
329.
Consider an inventory system consisting of two installations, the stocking point and the field. Each period two decisions must be made: how much to order from outside the system and how much to ship to the field. The first decision is made based on the total amounts of stock then at the two installations. Next a forecast of the demand in the current period is sent from the field to the stocking point. Based upon a knowledge of the joint distribution of the forecast and the true demand, and the amounts of stock at the two installations, a decision to ship a certain amount of stock to the field is taken. The goal is to make these two decisions so as to minimize the total n-period cost for the system. Following the factorization idea of Clark and Scarf (1960), the optimal n period ordering and shipping policy, taking into account the accuracy of the demand forecasts, can be derived so as to make the calculation comparable to those required by two single installations.  相似文献   
330.
Policy decisions for insurance type items, where zero or one unit is maintained at the depot, are more difficult and more critical than decisions for common supply items. This report presents results of developing initial provisioning guidelines for insurance type items. The guidelines are based on examination of lifetime costs and benefits. Costs of stocking an item as compared with not stocking are developed through a sinking fund annual payment formulation. Benefits of stocking are developed as stationary reduction in time weighted backorders experienced. A resource allocation formulation yields an optimal policy for allocating a fixed budget. The guideline is presented with refinements based on a sample of items. A figure of merit is calculated for each item, and if it is large the item is stocked while if small it is not stocked. Empirical definitions for large and small are developed based on sample data. Estimation techniques are discussed for deriving all of an item's parameters needed to compute its figure of merit. A Bayes procedure is suggested based on family group Experienced Demand Replacement Factors. This and other techniques are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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