首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   291篇
  免费   10篇
  2021年   11篇
  2019年   8篇
  2018年   6篇
  2017年   5篇
  2016年   4篇
  2015年   3篇
  2014年   4篇
  2013年   39篇
  2011年   3篇
  2010年   3篇
  2009年   10篇
  2007年   6篇
  2006年   2篇
  2005年   3篇
  2004年   7篇
  2003年   2篇
  2002年   9篇
  2001年   5篇
  2000年   5篇
  1999年   6篇
  1998年   5篇
  1997年   3篇
  1996年   3篇
  1995年   8篇
  1994年   3篇
  1993年   5篇
  1992年   4篇
  1991年   8篇
  1990年   4篇
  1989年   10篇
  1988年   7篇
  1987年   11篇
  1986年   8篇
  1984年   10篇
  1983年   3篇
  1982年   2篇
  1981年   5篇
  1980年   4篇
  1979年   4篇
  1978年   5篇
  1977年   5篇
  1976年   4篇
  1975年   3篇
  1974年   4篇
  1973年   4篇
  1972年   3篇
  1971年   2篇
  1970年   4篇
  1969年   5篇
  1968年   2篇
排序方式: 共有301条查询结果,搜索用时 15 毫秒
101.
We consider a bivariate Pareto distribution, as a generalization of the Lindley-Singpurwalla model, by incorporating the influence of the operating conditions on a two-component dependent system. The properties of the model and its applications to reliability analysis are discussed. © 1993 John Wiley & Sons, Inc.  相似文献   
102.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc.  相似文献   
103.
104.
105.
In this paper we optimally control service rates for an inventory system of service facilities with perishable products. We consider a finite capacity system where arrivals are Poisson‐distributed, lifetime of items have exponential distribution, and replenishment is instantaneous. We determine the service rates to be employed at each instant of time so that the long‐run expected cost rate is minimized for fixed maximum inventory level and capacity. The problem is modelled as a semi‐Markov decision problem. We establish the existence of a stationary optimal policy and we solve it by employing linear programming. Several numerical examples which provide insight to the behavior of the system are presented. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 464–482, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10021  相似文献   
106.
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038  相似文献   
107.
108.
A double-ended queue with a Poisson arrival pattern is examined in a situation where the rates depend (in a restricted sense) on both the time and the state of the system. Under some circumstances, the rates can be controlled. This article studies the distribution of the difference in queue sizes for each member of a large class of control strategies and introduces the problem of determining the optimal times at which the control should be in effect in order to maximize certain objective functions.  相似文献   
109.
What has been causing cost overruns and schedule slippages in Army major weapon-system R&D programs during the past ten years? This article addresses this question with emphasis on the effectiveness of an Army acquisition strategy entitled Total Risk Assessing Cost Estimating (TRACE). An empirical study employed a questionnaire and interviews with key personnel from all of the major Army Program Management Offices involved with R&D. The major research question was the following: What explanatory variables have been affecting R&D cost overruns and development time? This includes an evaluation of TRACE as a potential explanatory variable. Data was collected and analyzed using an error components multiple regression model. The major explanatory variables that appeared to explain cost overruns were technological risk of the program, education and experience of key program management office personnel, and the degree of “buy in” by the prime contractor. Strong statistical results indicate that TRACE is having little or no effect on cost overruns. In the case of development time, the major explanatory variables were seen to be technological risk of the program, testing, TRACE, education, and length of the R&D contract.  相似文献   
110.
This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V-shaped. © 1997 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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