首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   211篇
  免费   90篇
  国内免费   4篇
  2022年   1篇
  2021年   7篇
  2020年   14篇
  2019年   12篇
  2018年   4篇
  2017年   8篇
  2016年   14篇
  2015年   12篇
  2014年   15篇
  2013年   6篇
  2012年   16篇
  2011年   26篇
  2010年   9篇
  2009年   14篇
  2008年   13篇
  2007年   14篇
  2006年   18篇
  2005年   17篇
  2004年   13篇
  2003年   7篇
  2002年   10篇
  2001年   13篇
  2000年   7篇
  1999年   8篇
  1998年   12篇
  1997年   4篇
  1996年   2篇
  1995年   1篇
  1994年   3篇
  1993年   3篇
  1992年   1篇
  1990年   1篇
排序方式: 共有305条查询结果,搜索用时 0 毫秒
201.
We examine the problem of adaptively scheduling perfect observations and preventive replacements for a multi‐state, Markovian deterioration system with silent failures such that total expected discounted cost is minimized. We model this problem as a partially observed Markov decision process and show that the structural properties of the optimal policy hold for certain non‐extreme sample paths. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
202.
One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This article discusses ways—old and new—to cope with that time‐varying demand. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
203.
One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and Lmax and Cmax objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
204.
Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
205.
The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
206.
属性约简与近似集的关系研究   总被引:1,自引:0,他引:1       下载免费PDF全文
上近似和下近似是在粗集理论中最基本的概念,而粗集理论的主要思想又是在保持分类能力不变的前提下通过对属性的约简导出问题的决策和分类规则。本文讨论了属性的约简和相对约简与上近似和下近似的关系,并在此基础上提出了一种新的相对约简———保近似约简。  相似文献   
207.
分布参数管道的一种改进的小分段数有限元模型   总被引:2,自引:0,他引:2       下载免费PDF全文
在分段数为1和2时,现有有限元模型的一阶谐振频率比一维分布参数模型的一阶谐振频率低许多,因而其适用的频率范围较低,计算精度较差。本文提出了一种改进的小分段数有限元模型,通过修正流体管道的并联导纳使分段数为1和2时的有限元模型的一阶谐振频率与一维分布参数模型一致,从而提高了其使用的频率范围和计算精度。利用单根管道阀门关闭的水击问题的仿真计算对改进模型的效果进行了验证。在分段数为2时,原有的有限元模型的计算结果与分布参数模型的计算结果相差较大,而改进后的模型的计算结果与分布参数模型的计算结果基本一致。  相似文献   
208.
以某泵压式液体火箭发动机为研究对象,用试车数据对发动机静特性数学模型进行了验证,在验证模型时既考虑了外部干扰因素的实际测量误差范围和内部干扰因素的实际变化范围,又考虑了发动机参数实测量的误差范围,并且使用了随机仿真的方法。验证结果表明,发动机静特性的非线性数学模型是足够准确的,所用的计算方法是合理的。  相似文献   
209.
该方法将传递函数方法与传统的随机摄动分析理论相结合 ,将随机场作Karhunen Loeve正交展开 ,对静态随机梁结构进行了分析 ,并计算了其可靠性指标。这样一来克服了传统的有限元数值方法计算量大的困难 ,确立了随机梁结构分析的一种解析方法。  相似文献   
210.
随机弱实时系统作业调度概率保证分析   总被引:1,自引:0,他引:1       下载免费PDF全文
随机弱实时系统与强实时系统的显著区别是 ,它不要求实时任务的每一项作业都满足时限要求 ,只要保证作业的时限延误率低于某一阈值 ,其总体执行性能就是可以接受的。提出了概率时间需求分析法 (PTDA) ,用于估计可剥夺静态优先级调度策略下周期性任务的作业满足时限约束的概率的下界 ,并通过一个具体的实例考察了下界的紧性。对实例系统的仿真结果表明 ,PTDA分析的误差小于 1 0 % ,计算速度快 ,可以为弱实时应用的设计提供重要的参考依据  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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