全文获取类型
收费全文 | 335篇 |
免费 | 14篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 75篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 10篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 2篇 |
1989年 | 8篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有350条查询结果,搜索用时 31 毫秒
341.
342.
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models. 相似文献
343.
This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
344.
Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes 下载免费PDF全文
In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015 相似文献
345.
Regardless of the outcome, civil wars are destructive events. They not only devastate the physical and human capital of a society, but also have a direct effect on state capacity. The capacity of the state is critical as it attempts to rebuild society and minimize the risk of a new civil conflict; yet, it is still not clear how civil war precisely affects state capacity. In general, we argue that incumbent victors are more likely to end with a stronger state when the conflict is short and the victory is decisive. In contrast, rebel victors require more time to build their internal capacity and thus have stronger states after a longer conflict, especially when they had access to lootable resources. 相似文献
346.
We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
347.
348.
349.
350.
This article analyzes two general warranty policies involving an initial free replacement period, followed by a pro rata period. We examine the short-run total costs and longrun average costs under these policies. Formulas for both consumer costs and manufacturer profits under warranty are derived. We also study the expected number of purchases over the product life cycle under both policies. Bounds for the expected total costs and expected number of purchases are obtained for the case where the failure distribution of the item is new better than used. 相似文献