全文获取类型
收费全文 | 1305篇 |
免费 | 521篇 |
国内免费 | 87篇 |
出版年
2024年 | 3篇 |
2023年 | 10篇 |
2022年 | 17篇 |
2021年 | 39篇 |
2020年 | 24篇 |
2019年 | 31篇 |
2018年 | 39篇 |
2017年 | 57篇 |
2016年 | 96篇 |
2015年 | 74篇 |
2014年 | 99篇 |
2013年 | 98篇 |
2012年 | 98篇 |
2011年 | 108篇 |
2010年 | 78篇 |
2009年 | 111篇 |
2008年 | 98篇 |
2007年 | 95篇 |
2006年 | 92篇 |
2005年 | 82篇 |
2004年 | 85篇 |
2003年 | 58篇 |
2002年 | 64篇 |
2001年 | 58篇 |
2000年 | 33篇 |
1999年 | 45篇 |
1998年 | 40篇 |
1997年 | 34篇 |
1996年 | 28篇 |
1995年 | 9篇 |
1994年 | 24篇 |
1993年 | 17篇 |
1992年 | 20篇 |
1991年 | 13篇 |
1990年 | 28篇 |
1989年 | 6篇 |
1988年 | 2篇 |
排序方式: 共有1913条查询结果,搜索用时 140 毫秒
81.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
82.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
83.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
84.
针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。 相似文献
85.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
86.
在考虑轴承气膜交界面处切向速度滑移的条件下,建立了局部多孔质气浮止推轴承的理论模型,然后使用有限元算法进行了数值仿真,仿真的结果与试验结果取得了一定程度的一致性,说明此新的修改了的雷诺方程可以用来作为局部多孔质气浮止推轴承研究的理论模型。利用该模型,能够成功计算出不同渗透系数、不同厚度及不同直径的局部多孔质气浮轴承的流量、承载及刚度。还从理论上与小孔类型及全多孔质类型的气浮轴承特性进行了对比,结果表明,局部多孔质气浮轴承有着优良的特性及很好的应用前景。 相似文献
87.
88.
89.
90.