全文获取类型
收费全文 | 570篇 |
免费 | 8篇 |
出版年
2021年 | 7篇 |
2019年 | 8篇 |
2018年 | 11篇 |
2017年 | 7篇 |
2016年 | 14篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 132篇 |
2012年 | 5篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2007年 | 12篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 11篇 |
2002年 | 11篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 12篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 12篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 15篇 |
1987年 | 13篇 |
1986年 | 14篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1973年 | 5篇 |
1972年 | 6篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 8篇 |
1967年 | 7篇 |
1948年 | 4篇 |
排序方式: 共有578条查询结果,搜索用时 15 毫秒
461.
462.
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. 相似文献
463.
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. 相似文献
464.
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. 相似文献
465.
Previous studies criticize the general use of the normal approximation of lead-time demand on the grounds that it can lead to serious errors in safety stock. We reexamine this issue for the distribution of fast-moving finished goods. We first determine the optimal reorder points and quantities by using the classical normal-approximation method and a theoretically correct procedure. We then evaluate the misspecification error of the normal approximation solution with respect to safety stock, logistics-system costs, total costs (logistics costs, including acquisition costs), and fill rates. The results provide evidence that the normal approximation is robust with respect to both cost and service for seven major industry groups. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 165–186, 1997 相似文献
466.
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. 相似文献
467.
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. 相似文献
468.
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. 相似文献
469.
A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
470.
Unit‐load warehouses store and retrieve unit‐loads, typically pallets. When storage and retrieval operations are not coordinated, travel is from a pickup and deposit (P&D) point to a pallet location and back again. In some facilities, workers interleave storage and retrieval operations to form a dual‐command cycle. Two new aisle designs proposed by Gue and Meller (“Improving the unit‐load warehouse.” In Progress in Material Handling Research: 2006. Material Handling Industry of America, Charlotte, NC, 2006) use diagonal aisles to reduce the travel distance to a single pallet location by approximately 10 and 20[percnt] for the two designs, respectively. We develop analytical expressions for travel between pallet locations for one of these—the fishbone design. We then compare fishbone warehouses that have been optimized for dual‐command to traditional warehouses that have been optimized in the same manner, and show that an optimal fishbone design reduces dual‐command travel by 10–15%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 54: 389–403, 2009 相似文献