全文获取类型
收费全文 | 399篇 |
免费 | 16篇 |
出版年
2021年 | 9篇 |
2020年 | 4篇 |
2019年 | 10篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 11篇 |
2014年 | 5篇 |
2013年 | 83篇 |
2011年 | 7篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 8篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 11篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 6篇 |
1974年 | 9篇 |
1973年 | 6篇 |
1972年 | 6篇 |
1971年 | 11篇 |
1970年 | 3篇 |
1969年 | 7篇 |
1968年 | 8篇 |
1967年 | 4篇 |
1966年 | 4篇 |
1948年 | 4篇 |
排序方式: 共有415条查询结果,搜索用时 382 毫秒
161.
In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made. 相似文献
162.
The problem of determining the optimal inspection epoch is studied for reliability systems in which N components operate in parallel. Lifetime distribution is arbitrary, but known. The optimization is carried with respect to two cost factors: the cost of inspecting a component and the cost of failure. The inspection epochs are determined so that the expected cost of the whole system per time unit per cycle will be minimized. The optimization process depends in the general case on the whole failure history of the system. This dependence is characterized. The cases of Weibull lifetime distributions are elaborated and illustrated numerically. The characteristics of the optimal inspection intervals are studied theoretically. 相似文献
163.
A manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases. 相似文献
164.
A flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure. 相似文献
165.
In this note the authors call for a change of the optimality criteria given by Theorem 3 in section 5 of the paper of W. Szwarc “On Some Sequencing Problems” in NRLQ Vol. 15, No. 2 [2]. Further, two cases of the three machine problem, namely, (i) ≦ and (ii) ≦ are considered, and procedures for obtaining optimal sequences in these cases are given. In these cases the three-machine problem is solved by solving n (the number of jobs) two-machine problems. 相似文献
166.
Much work has been done in search theory; however, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these Probabilities remain fixed for all searching and locations. The class of sequential search policies which terminate the search at the first acceptance is assumed. A single two-part optimization criterion is considered. The search sequence is found which (i) minimizes the probability of obtaining n rejections in the first n steps for all n, and (ii) maximizes the probability that the first acceptance occurs within the first n steps and occurs at the object's location for all n. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location. 相似文献
167.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献
168.
This article presents the results of comparing the performance of several cannibalization policies using a simulation model of a maintenance system with spares, repair, and resource constraints. Although the presence of cannibalization has been incorporated into a number of maintenance system models reported in the literature, the questions of whether cannibalization should be done and what factors affect canibalization have received little attention. Policies tested include both no cannibalization and unlimited cannibalization as well as other based on the number of maintenance personnel available, the short-term machine failure rate at the time of cannibalization, and the relationship between the mean cannibalization and repair rates. The best policies found are those that allow cannibalization only when it can be done quickly relative to repair or when it can be done without delaying part repair actions. The policy of complete cannibalization (always cannibalize when it is possible) is found to perform poorly except when either average maintenance personnel utilization is very low or when mean cannibalization times are very short relative to mean repair times. The latter result casts doubts on the appropriateness of the assumption of complete cannibalization in many models in the literature. 相似文献
169.
After first formulating the problem of the Marine Environmental Protection program of the Coast Guard as a multiple-objective linear program, we investigate the applicability and limitations of goal programming. We point out how the preemptive goal-programming approach is incompatible with utility preferences. Then we observe the tendency of optimal solutions for standard linear goal programs to occur at extreme points. We also note problems of more general approaches, such as dealing with additively separable approximations to preferences. 相似文献
170.
A dynamic version of the transportation (Hitchcock) problem occurs when there are demands at each of n sinks for T periods which can be fulfilled by shipments from m sources. A requirement in period t2 can be satisfied by a shipment in the same period (a linear shipping cost is incurred) or by a shipment in period t1 < t2 (in addition to the linear shipping cost a linear inventory cost is incurred for every period in which the commodity is stored). A well known method for solving this problem is to transform it into an equivalent single period transportation problem with mT sources and nT sinks. Our approach treats the model as a transshipment problem consisting of T, m source — n sink transportation problems linked together by inventory variables. Storage requirements are proportional to T2 for the single period equivalent transportation algorithm, proportional to T, for our algorithm without decomposition, and independent of T for our algorithm with decomposition. This storage saving feature enables much larger problems to be solved than were previously possible. Futhermore, we can easily incorporate upper bounds on inventories. This is not possible in the single period transportation equivalent. 相似文献