首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   480篇
  免费   12篇
  492篇
  2021年   11篇
  2019年   21篇
  2018年   10篇
  2017年   10篇
  2016年   11篇
  2015年   11篇
  2014年   9篇
  2013年   95篇
  2011年   4篇
  2009年   5篇
  2008年   5篇
  2007年   5篇
  2006年   5篇
  2005年   9篇
  2004年   8篇
  2003年   6篇
  2002年   6篇
  2001年   4篇
  2000年   7篇
  1999年   4篇
  1998年   9篇
  1997年   15篇
  1996年   7篇
  1994年   10篇
  1992年   4篇
  1991年   13篇
  1990年   4篇
  1989年   7篇
  1988年   7篇
  1987年   14篇
  1986年   8篇
  1985年   6篇
  1984年   5篇
  1983年   8篇
  1982年   8篇
  1981年   5篇
  1980年   7篇
  1979年   11篇
  1978年   7篇
  1977年   8篇
  1976年   7篇
  1975年   7篇
  1974年   7篇
  1973年   12篇
  1972年   6篇
  1971年   6篇
  1970年   7篇
  1969年   6篇
  1968年   5篇
  1967年   5篇
排序方式: 共有492条查询结果,搜索用时 0 毫秒
61.
本文基于有限元方法,针对不同的速度参数和离心率,采用一种直接的数字方法来计算多孔外压空气轴颈轴承的性能指标,并把模拟结果同参考资料上一种空气心轴轴颈轴承的计算进行了比较。  相似文献   
62.
随着对结构化超精密部件需要的不断增加,出现了加工具有高的表面光洁度以及形状精度的非旋转对称镜片的新技术。根据现有的快速刀具伺服系统,研制出了最大行程为16mm的新型快速刀具伺服系统(图1)。以前的快速刀具伺服系统采用了弹性导向机构,而现在的快速刀具伺服系统则采用了空气轴承,并且用了一个高频直线电机来驱动这个系统。由于采用了一个新的功率放大器,使得这个系统能够最高达到100Hz的频率以及1mm的振动幅度。这篇文章给出了这种新型快速刀具伺服系统的技术细节。  相似文献   
63.
This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain.  相似文献   
64.
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015  相似文献   
65.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998  相似文献   
66.
Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998  相似文献   
67.
68.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.  相似文献   
69.
The facility location and capacity acquisition decisions are intertwined, especially within the international context where capacity acquisition costs are location dependent. A review of the relevant literature however, reveals that the facility location and the capacity acquisition problems have been dealt with separately. Thus, an integrated approach for simultaneous optimization of these strategic decisions is presented. Analytical properties of the arising model are investigated and an algorithm for solving the problem is devised. Encouraging computational results are reported. © 1995 John Wiley & Sons, Inc.  相似文献   
70.
An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K2 + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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