全文获取类型
收费全文 | 631篇 |
免费 | 19篇 |
国内免费 | 1篇 |
出版年
2021年 | 11篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 6篇 |
2014年 | 11篇 |
2013年 | 111篇 |
2012年 | 8篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 7篇 |
2007年 | 14篇 |
2006年 | 7篇 |
2004年 | 5篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2000年 | 5篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 11篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 21篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 19篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 14篇 |
1981年 | 10篇 |
1980年 | 15篇 |
1979年 | 14篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 10篇 |
1975年 | 14篇 |
1974年 | 14篇 |
1973年 | 11篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 9篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有651条查询结果,搜索用时 15 毫秒
521.
522.
Shau‐Shiang Ja Vidyadhar G. Kulkarni Amitava Mitra Jayprakash G. Patankar 《海军后勤学研究》2002,49(5):499-513
Estimation of warranty costs, in the event of product failure within the warranty period, is of importance to the manufacturer. Costs associated with replacement or repair of the product are usually drawn from a warranty reserve fund created by the manufacturer. Considering a stochastic sales process, first and second moments (and thereby the variance) are derived for the manufacturer's total discounted warranty cost of a single sale for single‐component items under four different warranty policies from a manufacturer's point of view. These servicing strategies represent a renewable free‐replacement, nonrenewable free‐replacement, renewable pro‐rata, and a nonrenewable minimal‐repair warranty plans. The results are extended to determine the mean and variance of total discounted warranty costs for the total sales over the life cycle of the product. Furthermore, using a normal approximation, warranty reserves necessary for a certain protection level, so that reserves are not completely depleted, are found. Results and their managerial implications are studied through an extensive example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 499–513, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10023 相似文献
523.
This article examines measures of economic efficiency in aircraft production. In particular, a type of nonlinear frontier estimation is contrasted with more traditional methods for estimating a dynamic cost function. This cost function is grounded in economic theory, and it is consistent with knowledge of the aircraft-production process. The model includes the effects of both learning and production rate on total program costs. The usefulness of the model is demonstrated with an example that relates to the acquisition of military equipment. It is shown through various sensitivity analyses that an alternative procurement policy for an aircraft program could have resulted in increased efficiency and hence a lower total program cost to the government. 相似文献
524.
The problem considered in this article is a generalization of the familiar makespan problem, in which n jobs are allocated among m parallel processors, so as to minimize the maximum time (or cost) on any processor. Our problem is more general, in that we allow the processors to have (a) different initial costs, (b) different utilization levels before new costs are incurred, and (c) different rates of cost increase. A heuristic adapted from the bin-packing problem is shown to provide solutions which are close to optimal as the number of iterations is allowed to increase. Computational testing, over a large number of randomly generated problem instances, suggests that heuristic errors are, on average, very small. 相似文献
525.
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm. 相似文献
526.
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. 相似文献
527.
This paper proposes the use of a cost-based statistical process control system for monitoring the quality of an unreliable analytical machine. In this environment the accuracy of the process cannot be determined by inspecting the output, but must be verified by analyzing standards of known values. The results demonstrate that a significant cost savings can be obtained if analytical results are placed in a “buffer” and their release delayed until the accuracy of the test can be assured. Results suggest the approach not only dramatically improves the quality of results reported but also significantly reduces the expected total cost of testing. © 1996 John Wiley & Sons, Inc. 相似文献
528.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc. 相似文献
529.
Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information. 相似文献
530.