首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   509篇
  免费   98篇
  国内免费   24篇
  2024年   1篇
  2023年   3篇
  2022年   3篇
  2021年   14篇
  2020年   13篇
  2019年   9篇
  2018年   6篇
  2017年   10篇
  2016年   16篇
  2015年   28篇
  2014年   23篇
  2013年   73篇
  2012年   24篇
  2011年   23篇
  2010年   43篇
  2009年   32篇
  2008年   44篇
  2007年   34篇
  2006年   30篇
  2005年   30篇
  2004年   24篇
  2003年   17篇
  2002年   25篇
  2001年   22篇
  2000年   13篇
  1999年   20篇
  1998年   6篇
  1997年   3篇
  1996年   1篇
  1995年   5篇
  1994年   5篇
  1993年   3篇
  1992年   4篇
  1991年   1篇
  1990年   4篇
  1989年   2篇
  1988年   1篇
  1987年   3篇
  1986年   2篇
  1985年   2篇
  1983年   1篇
  1982年   1篇
  1981年   1篇
  1979年   1篇
  1978年   3篇
  1973年   1篇
  1967年   1篇
排序方式: 共有631条查询结果,搜索用时 62 毫秒
371.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010  相似文献   
372.
模糊AHP的舰机协同对潜搜索方式优选   总被引:1,自引:0,他引:1  
战术背景下的多目标方案选择是战术行动的关键,且具有一定的不确定性和模糊性。从分析舰机协同对潜搜索战术方法出发,针对四种搜索方式的不同特点和优劣,研究了基于模糊层次分析法的搜索方案优化选择方法。根据选取的作战指标对搜索方式进行了仿真,并计算了各方案相对于准则的权重并对其进行排序,得出了结论,验证了方法的可行性和有效性。探讨的舰机协同对潜搜索方式优选方法及得出的结论,对实际反潜战的指挥决策有一定的应用价值。  相似文献   
373.
分析研究了弹药破片对目标的毁伤机理并用多维向量描述了破片场的组成。破片场的分布研究是进行破片场模拟的基础,提出了基于统计数据和理论分析的破片场分布研究方法,建立了相应的破片场模拟数学模型。通过仿真验证,这种以破片场计算、抽样模拟两部分组成的弹药破片场模拟方法是可行的,而且这种方法对于弹药其他的效能单元模拟具有指导意义。  相似文献   
374.
我军的优良传统来之不易、弥足珍贵,当代中国军人理应备加珍惜,当好传人;我军的优良传统博大精深、价值非凡,当代中国军人理应深刻领悟,自觉践行;我军的优良传统生机勃勃、充满活力,当代中国军人理应为之添薪拨火,续写新篇。  相似文献   
375.
A joint optimization of the production run length and preventive maintenance (PM) policy is studied for a deteriorating production system where the in‐control period follows a general probability distribution with non‐decreasing failure rate. In the literature, the sufficient conditions for the optimality of the equal‐interval PM schedule is explored to derive an optimal production run length and an optimal number of PM actions. Nevertheless, an exhaustive search may arise. In this study, based on the assumption that the conditions for the optimality of the equal‐interval PM schedule hold, we derive some structural properties for the optimal production/PM policy, which increases the efficiency of the solution procedure. These analyses have implications for the practical application of the production/PM model to be more available in practice. A numerical example of gamma shift distribution with non‐decreasing failure rates is used to illustrate the solution procedure, leading to some insight into the management process. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
376.
We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
377.
研究了在OpenGVS仿真平台上实现目标自动跟踪系统仿真的方法。根据目标自动跟踪系统的基本原理建立了其系统的仿真数学模型,然后运用MFC,OpenGVS在HLA搭建的对抗仿真环境中实现了半实物仿真。  相似文献   
378.
Manufacturer rebates are commonly used as price discount tools for attracting end customers. In this study, we consider a two‐stage supply chain with a manufacturer and a retailer, where a single seasonal product faces uncertain and price‐sensitive demand. We characterize the impact of a manufacturer rebate on the expected profits of both the manufacturer and the retailer. We show that unless all of the customers claim the rebate, the rebate always benefits the manufacturer. Our results thus imply that “mail‐in rebates,” where some customers end up not claiming the rebate, particularly when the size of the rebate is relatively small, always benefit the manufacturer. On the other hand, an “instant rebate,” such as the one offered in the automotive industry where every customer redeems the rebate on the spot when he/she purchases a car, does not necessarily benefit the manufacturer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
379.
In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
380.
Uncertainties abound within a supply chain and have big impacts on its performance. We propose an integrated model for a three‐tiered supply chain network with one supplier, one or more facilities and retailers. This model takes into consideration the unreliable aspects of a supply chain. The properties of the optimal solution to the model are analyzed to reveal the impacts of supply uncertainty on supply chain design decisions. We also propose a general solution algorithm for this model. Computational experience is presented and discussed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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