全文获取类型
收费全文 | 606篇 |
免费 | 18篇 |
出版年
2020年 | 5篇 |
2019年 | 9篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 8篇 |
2013年 | 122篇 |
2011年 | 6篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 14篇 |
1987年 | 13篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 12篇 |
1974年 | 11篇 |
1973年 | 11篇 |
1972年 | 13篇 |
1971年 | 13篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1948年 | 5篇 |
排序方式: 共有624条查询结果,搜索用时 15 毫秒
461.
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model—shown to be NP-hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc. 相似文献
462.
The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and due dates for single and m parallel machines. For the single-machine case, the proposed heuristic is compared with the well-known Wilkerson and Irwin algorithm; for the m parallel machine case, it is compared with an extension of the Wilkerson-Irwin algorithm. We also introduce a simple dispatching rule, and it is compared with some existing dispatching rules. The comprehensive simulation results show that the proposed heuristic performs better than the Wilkerson-Irwin algorithm at a significantly reduced computational time. 相似文献
463.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F. 相似文献
464.
The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal. 相似文献
465.
With repeated firing, fatigue cracks are produced in a gun barrel, and the barrel is no longer useful when a crack reaches a critical size. The initial crack size and the critical crack size, as well as the number of firings producing the critical crack size, may be considered as random variables. Assuming a proportional damage model for crack growth, a method for estimating the critical crack size distribution is presented. From these results, an estimate of the barrel life, or the residual barrel life once a crack of a given size is measured, can be obtained. 相似文献
466.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc. 相似文献
467.
The article presents a Bayesian analysis for the environmental stress screening problem. The decision problem of deriving optimal stress screen durations is solved. Given a screen duration, the optimal stress level can also be determined. Indicators of the quality of a screen of any duration are derived. A statistical model is presented which allows a posterior density for the rate of early failures of the production process to be calculated. This enables the user to update his opinion about the quality of the process. © 1994 John Wiley & Sons, Inc. 相似文献
468.
Fan C. Meng 《海军后勤学研究》1994,41(5):661-668
Various mathematical models for multistate systems have been proposed in the literature. Among them the model introduced by Barlow and Wu is the one most intimately related to that of binary systems; hence the Barlow-Wu class possesses many nice properties inherited from the binary systems. In this article we obtain several characterization results for multistate systems, which closely relate the Barlow-Wu class to other classes of multistate systems. The characterizations we obtained originate from the invariance properties of the Barlow-Wu functions, and are easy to apply in verifying whether a particular model is of the Barlow-Wu type. © 1994 John Wiley & Sons, Inc. 相似文献
469.
For the loss system with time-varying intensities and a finite number of identical servers we derive formulas for the expected number of refused customers in a given time interval and for the expected number of servers busy at a given time instant. © 1994 John Wiley & Sons, Inc. 相似文献
470.
Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc. 相似文献