首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   286篇
  免费   5篇
  291篇
  2021年   4篇
  2019年   8篇
  2018年   5篇
  2017年   4篇
  2015年   3篇
  2014年   4篇
  2013年   44篇
  2010年   4篇
  2009年   3篇
  2008年   6篇
  2006年   2篇
  2005年   2篇
  2004年   5篇
  2003年   4篇
  2002年   3篇
  2001年   4篇
  2000年   4篇
  1998年   5篇
  1997年   4篇
  1996年   9篇
  1995年   4篇
  1994年   2篇
  1993年   4篇
  1992年   5篇
  1991年   8篇
  1990年   5篇
  1989年   8篇
  1988年   8篇
  1987年   7篇
  1986年   7篇
  1985年   6篇
  1984年   6篇
  1983年   2篇
  1982年   4篇
  1981年   5篇
  1980年   10篇
  1979年   4篇
  1978年   6篇
  1977年   4篇
  1976年   5篇
  1975年   6篇
  1974年   4篇
  1973年   2篇
  1972年   3篇
  1971年   8篇
  1970年   4篇
  1969年   4篇
  1968年   5篇
  1967年   4篇
  1966年   6篇
排序方式: 共有291条查询结果,搜索用时 0 毫秒
231.
232.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001  相似文献   
233.
234.
235.
The following article tests the hypothesis that veterans have better health if they were officers when they were in the U.S. military than if they served in the enlisted ranks. It examines this hypothesis by presenting results from logistic regressions that are based on four surveys: the National Survey of Veterans, the Survey of Retired Military, the Panel Study of Income Dynamics, and the Wisconsin Longitudinal Study. In all four of these surveys, the evidence is consistent with the hypothesis that military rank is associated with health, particularly among veterans who served longer. It also suggests that the health gradient by rank is independent of similar gradients by education and income as well as health differences by race. These findings indicate that health may be influenced not just by differences in civilian society but also by those in the military.  相似文献   
236.
A single machine is available to process a collection of stochastic tasks. Processing is interrupted when the machine breaks down. We introduce a new model of breakdowns that more realistically incorporates the effects that job processing may have on the machine. This failure propagation model is equivalent to a Bayesian formulation in which learning about breakdown rates occurs as jobs evolve. Optimal scheduling policies are described in terms of Gittins indices and these indices are characterised in two special cases. For example, we obtain conditions which ensure that an optimal policy will only preempt a job's processing either at its completion or at a machine breakdown. We also bound the value lost by simplistic modelling which ignores the learning phenomenon. © 1996 John Wiley & Sons, Inc.  相似文献   
237.
We consider the problem of scheduling customer orders, each consisting of one or more individual jobs, on a set of parallel processors with the objective of minimizing average order completion time. We provide simple intuitive heuristics to guide managers in this environment and introduce lower bounds that show that these heuristics are effective for a wide variety of problems. © 1996 John Wiley & Sons, Inc.  相似文献   
238.
239.
240.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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