全文获取类型
收费全文 | 536篇 |
免费 | 11篇 |
出版年
2021年 | 6篇 |
2019年 | 18篇 |
2018年 | 10篇 |
2017年 | 14篇 |
2016年 | 11篇 |
2015年 | 10篇 |
2013年 | 102篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 7篇 |
2005年 | 11篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 14篇 |
1988年 | 9篇 |
1987年 | 13篇 |
1986年 | 9篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 9篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 14篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有547条查询结果,搜索用时 15 毫秒
141.
A discrete time Collection Model is formulated, involving the completion of a touring objective on a network with stochastic node states. Heuristic touring strategies are constructed, there being as yet inadequate analytic results for its optimal solution. Effectiveness of the heuristics is assessed by comparing expected tour times under the heuristics with expected tour times given perfect information. A branch and bound algorithm is presented for computing the perfect information tour times. 相似文献
142.
Suppose a given set of jobs has to be processed on a multi-purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence-dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large-dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach. 相似文献
143.
144.
A. P. Basu 《海军后勤学研究》1971,18(3):329-337
Let us assume that observations are obtained at random and sequentially from a population with density function In this paper we consider a sequential rule for estimating μ when σ is unknown corresponding to the following class of cost functions In this paper we consider a sequential rule for estimating μ when σ is unknown corresponding to the following class of cost functions Where δ(XI,…,XN) is a suitable estimator of μ based on the random sample (X1,…, XN), N is a stopping variable, and A and p are given constants. To study the performance of the rule it is compared with corresponding “optimum fixed sample procedures” with known σ by comparing expected sample sizes and expected costs. It is shown that the rule is “asymptotically efficient” when absolute loss (p=-1) is used whereas the one based on squared error (p = 2) is not. A table is provided to show that in small samples similar conclusions are also true. 相似文献
145.
The present study is concerned with the determination of a few observations from a sufficiently large complete or censored sample from the extreme value distribution with location and scale parameters μ and σ, respectively, such that the asymptotically best linear unbiased estimators (ABLUE) of the parameters in Ref. [24] yield high efficiencies among other choices of the same number of observations. (All efficiencies considered are relative to the Cramér-Rao lower bounds for regular unbiased estimators.) The study is on the asymptotic theory and under Type II censoring scheme. For the estimation of μ when σ is known, it has been proved that there exists a unique optimum spacing whether the sample is complete, right censored, left censored, or doubly censored. Several tables are prepared to aid in the numerical computation of the estimates as well as to furnish their efficiencies. For the estimation of σ when μ is known, it has been observed that there does not exist a unique optimum spacing. Accordingly we have obtained a spacing based on a complete sample which yields high efficiency. A similar table as above is prepared. When both μ and σ are unknown, we have considered four different spacings based on a complete sample and chosen the one yielding highest efficiency. A table of the efficiencies is also prepared. Finally we apply the above results for the estimation of the scale and/or shape parameters of the Weibull distribution. 相似文献
146.
A. S. Goldman 《海军后勤学研究》1969,16(1):111-120
Although industry is expected to design hardware to fit into a general support system and to be capable of arguing life-cycle system costs, adequate information has not been available on the support system in terms of policies and operating decision rules. Policies and operating decisions by users dominate engineering design decisions in determining life-cycle support costs. The relative effect of each of these decision areas on support costs has yet to be resolved empirically. Without an understanding of the sensitivity of support costs to alternative designs, capability is limited in design improvement and support of end items. Life-cycle costing of analysis under cost-effectiveness and the maintainability of integrated logistics support is open to question. 相似文献
147.
The intent of this paper is to demonstrate that the theory of stationary point processes is a useful tool for the analysis of stationary inventory systems. In conventional inventory theory, the equilibrium distributions for a specified inventory policy are obtained, whenever possible, by recursive or limiting procedures, or both. A different and more direct approach, based on stationary point processes, is proposed here. The time instants at which stock delivery is effected are viewed as points of the stationary point process, which possesses uniform statistical properties on the entire real axis; hence the equilibrium statistics of the inventory process can be calculated directly. In order to best illustrate this approach, various examples are given, including some that constitute new results. 相似文献
148.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
149.
150.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献