首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   375篇
  免费   5篇
  380篇
  2021年   4篇
  2019年   11篇
  2018年   9篇
  2017年   7篇
  2016年   6篇
  2015年   4篇
  2014年   6篇
  2013年   69篇
  2012年   5篇
  2010年   4篇
  2009年   5篇
  2008年   6篇
  2007年   3篇
  2006年   4篇
  2005年   3篇
  2004年   8篇
  2003年   6篇
  2002年   7篇
  2001年   6篇
  2000年   4篇
  1998年   6篇
  1997年   4篇
  1996年   12篇
  1995年   6篇
  1993年   4篇
  1992年   6篇
  1991年   10篇
  1990年   5篇
  1989年   9篇
  1988年   10篇
  1987年   8篇
  1986年   8篇
  1985年   7篇
  1984年   6篇
  1982年   5篇
  1981年   5篇
  1980年   11篇
  1979年   5篇
  1978年   6篇
  1977年   4篇
  1976年   5篇
  1975年   6篇
  1974年   5篇
  1972年   4篇
  1971年   9篇
  1970年   4篇
  1969年   4篇
  1968年   6篇
  1967年   4篇
  1966年   6篇
排序方式: 共有380条查询结果,搜索用时 0 毫秒
71.
72.
Several approximate procedures are available in the literature for obtaining confidence intervals for the parameter A of an exponential distribution based on time truncated samples. This paper contains the results of an empirical study comparing three of these procedures.  相似文献   
73.
74.
In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper.  相似文献   
75.
This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well-defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large-sized problems even with manual computational devices.  相似文献   
76.
The reliability of a serial production line is optimized with respect to the location of a single buffer. The problem was earlier defined and solved by Soyster and Toof for the special case of an even number of machines all having equal probability of failure. In this paper we generalize the results for any number of machines and remove the restriction of identical machine reliabilities. In addition, an analysis of multibuffer systems is presented with a closed form solution for the reliability when both the number of buffers and their capacity is limited. For the general multibuffer system we present an approach for determining system reliability.  相似文献   
77.
78.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout.  相似文献   
79.
This paper discusses the operations analysis in the underwater search for the remains of the submarine Scorpion The a priori target location probability distribution for the search was obtained by monte-carlo procedures based upon nine different scenarios concerning the Scorpion loss and associated credibility weights. These scenarios and weights were postulated by others. Scorpion was found within 260 yards of the search grid cell having the largest a priori probability Frequent computations of local effectiveness probabilities (LEPs) were carried out on scene during the search and were used to determine an updated (a posteriori) target location distribution. This distribution formed the basis for recommendation of the current high probability areas for search The sum of LEPs weighted by the a priori target location probabilities is called search effectiveness probability (SEP) and was used as the overall measure of effectiveness for the operation. SEP and LEPs were used previously in the Mediterranean H-bomb search On-scene and stateside operations analysis are discussed and the progress of the search is indicated by values of SEP for various periods during the operation.  相似文献   
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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