首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   201篇
  免费   9篇
  2021年   1篇
  2019年   4篇
  2018年   5篇
  2017年   8篇
  2016年   6篇
  2015年   6篇
  2014年   5篇
  2013年   70篇
  2012年   2篇
  2011年   5篇
  2010年   3篇
  2009年   4篇
  2008年   4篇
  2007年   2篇
  2006年   5篇
  2005年   7篇
  2004年   4篇
  2003年   2篇
  2002年   3篇
  2000年   2篇
  1999年   2篇
  1998年   2篇
  1997年   2篇
  1996年   3篇
  1995年   4篇
  1994年   5篇
  1993年   4篇
  1992年   6篇
  1991年   3篇
  1990年   2篇
  1989年   3篇
  1988年   3篇
  1987年   3篇
  1986年   1篇
  1985年   2篇
  1983年   2篇
  1981年   3篇
  1980年   1篇
  1979年   2篇
  1975年   3篇
  1973年   2篇
  1971年   1篇
  1970年   1篇
  1967年   1篇
  1966年   1篇
排序方式: 共有210条查询结果,搜索用时 421 毫秒
151.
We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
152.
153.
154.
155.
156.
Consider two machines, labeled 1 and 2. A set of tasks has to be processed first on machine 1 and after that on machine 2. A second set of tasks has to be processed first on machine 2 and after that on machine 1. All the processing times are exponentially distributed. We present a policy which minimizes the expected completion time of all tasks.  相似文献   
157.
158.
159.
160.
We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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