全文获取类型
收费全文 | 462篇 |
免费 | 15篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 9篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 94篇 |
2011年 | 5篇 |
2009年 | 4篇 |
2007年 | 7篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 8篇 |
1995年 | 12篇 |
1994年 | 13篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有477条查询结果,搜索用时 46 毫秒
391.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献
392.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999 相似文献
393.
394.
395.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献
396.
Peter C. Fishburn 《海军后勤学研究》1988,35(6):567-574
It is shown that when X is an arbitrary finite subset of an n-factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification-extension procedure. 相似文献
397.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved. 相似文献
398.
A centralized inventory system serves a number of stores with common ownership, and thus reliable and timely information sharing. Each of them pays a share of the inventory cost, and the reward structure leaves the owners of individual stores rewarded for their individual performance. Appropriate selection of a cost allocation method is important if such a centralized system is to last. In this work we propose three necessary criteria—stability (core of a related cooperative game), justifiability (consistency of benefits with costs), and polynomial computability. For a concrete example we demonstrate that common allocation procedures may not meet all three tests, and we present a method that that meets all three criteria. This kind of cost allocation analysis helps the common management to evaluate the trade-offs in choosing an allocation scheme for the cost of inventory centralization. © 1996 John Wiley & Sons, Inc. 相似文献
399.
Functional equations enable us to arrive at a simple consensus model for fatigue life of longitudinal elements based on engineering principles. The model is then applied to two representative data sets. By the application of proportional hazards techniques and subsequent likelihood analysis, simple parsimonious Weibull models are derived. Inter alia attention is given to the desirability of deriving models exhibiting plausible asymptotic independence. © 1996 John Wiley & Sons, Inc. 相似文献
400.
In this article we apply perturbation analysis (PA), combined with conditional Monte Carlo, to obtain derivative estimators of the expected cost per period with respect to s and S, for a class of periodic review (s, S) inventory systems with full backlogging, linear holding and shortage costs, and where the arrivals of demands follow a renewal process. We first develop the general form of four different estimators of the gradient for the finite-horizon case, and prove that they are unbiased. We next consider the problem of implementing our estimators, and develop efficient methodologies for the infinite-horizon case. For the case of exponentially distributed demand interarrival times, we implement our estimators using a single sample path. Generally distributed interarrival times are modeled as phase-type distributions, and the implementation of this more general case requires a number of additional off-line simulations. The resulting estimators are still efficient and practical, provided that the number of phases is not too large. We conclude by reporting the results of simulation experiments. The results provide further validity of our methodology and also indicate that our estimators have very low variance. © 1994 John Wiley & Sons, Inc. 相似文献