全文获取类型
收费全文 | 469篇 |
免费 | 12篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 100篇 |
2012年 | 4篇 |
2010年 | 8篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 10篇 |
1972年 | 7篇 |
1971年 | 9篇 |
1969年 | 7篇 |
1968年 | 10篇 |
1967年 | 4篇 |
1966年 | 4篇 |
1948年 | 5篇 |
排序方式: 共有482条查询结果,搜索用时 15 毫秒
181.
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. 相似文献
182.
In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed. 相似文献
183.
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. 相似文献
184.
James H. Patterson 《海军后勤学研究》1973,20(4):767-784
The applicability of critical path scheduling is limited by the inability of the algorithm to cope with conflicting resource demands. This paper is an assessment of the effectiveness of many of the heuristic extensions to the critical path method which resolve the conflicts that develop between the resources demanded by an activity and those available. These heuristic rules are evaluated on their ability to solve a large multiproject scheduling problem. 相似文献
185.
In this paper we investigate a form of rational behavior in response to an oligopoly pricing problem where only one buyer is involved. We investigate the problem from the standpoint of the seller who wants to maximize his gain from the transaction. In particular, we deal with the problem of one seller's response to an invitation to submit a sealed (i. e., noncooperative) bid to a government or other dominant purchasing agency for supplying a specified bundle of goods and services for which either (1) no other demand exists, or (2) the terms or quantities involved cannot, at least in the short run, be obtained from another source. Although treated from a normative standpoint, i. e., what bid the supplier should make, the paper also has implications for the buyer's behavior and oligopoly-monopsony pricing in a more general sense. 相似文献
186.
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. 相似文献
187.
A deterministic resource allocation model is developed to optimize defense effectiveness subject to budget, manpower, and risk constraints. The model consists of two major submodels connected by a heuristic. The first is a mathematical program which optimizes the multiperiod weapon mix subject to the constraint set. The second is a manpower supply model based on a transition matrix in which individual transitions are functions of personnel related budgets and historical transition rates. The heuristic marries the submodels through an iterative process leading to improved solutions. An example is provided which demonstrates how systems are undercosted and overprocured if manpower supply is not properly reflected relative to manpower demand. 相似文献
188.
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. 相似文献
189.
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. 相似文献
190.
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. 相似文献