全文获取类型
收费全文 | 1151篇 |
免费 | 124篇 |
国内免费 | 29篇 |
出版年
2022年 | 15篇 |
2021年 | 42篇 |
2020年 | 24篇 |
2019年 | 12篇 |
2018年 | 13篇 |
2017年 | 40篇 |
2016年 | 23篇 |
2015年 | 32篇 |
2014年 | 46篇 |
2013年 | 118篇 |
2012年 | 59篇 |
2011年 | 62篇 |
2010年 | 59篇 |
2009年 | 68篇 |
2008年 | 61篇 |
2007年 | 56篇 |
2006年 | 41篇 |
2005年 | 35篇 |
2004年 | 23篇 |
2003年 | 13篇 |
2002年 | 18篇 |
2001年 | 23篇 |
2000年 | 11篇 |
1999年 | 24篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 10篇 |
1995年 | 14篇 |
1994年 | 12篇 |
1993年 | 23篇 |
1992年 | 18篇 |
1991年 | 15篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 17篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1974年 | 8篇 |
1972年 | 14篇 |
1971年 | 10篇 |
1969年 | 12篇 |
1968年 | 8篇 |
排序方式: 共有1304条查询结果,搜索用时 46 毫秒
51.
Victoria L. Zhang 《海军后勤学研究》1996,43(5):691-708
This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc. 相似文献
52.
53.
Consider a set of vertices V = {1, 2,…, n} placed on a two-dimensional Euclidean plane R2 with each vertex attached a nonnegative weight w: V → R. For a given constant d>0, the geometric graph G = (V, E) is defined to have edge set E = {(i, j): dij ⩽ d} with dij being the Euclidean distance between vertices i and j. The geometric vertex packing (GVP) problem, which is often called the independent set problem, is defined as selecting the set of pairwise nonadjacent vertices with maximum total weight. We limit our attention to the special case that no vertex is within a distance βd of any other vertices where 0 ⩽ β < 1. A special value of β (= 1/2) is referred to frequently because of its correspondence to a manufacturing problem in circuit board testing. In this article we show that the weighted vertex packing problem for the specially structured geometric graph (SGVP) defined with the above restriction is NP-complete even for the case that all vertex weights are unity and for any β. Polynomial procedures have been designed for generating cuts to obtain tight LP upper bounds for the SGVP. Two heuristics with bounded worst-case performance are applied to the LP solution to produce a feasible solution and a lower bound. We then use a branch-and-bound procedure to solve the problem to optimality. Computational results on large-scale SGVP problems will be discussed. © 1995 John Wiley & Sons, Inc. 相似文献
54.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc. 相似文献
55.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
56.
P. Patrick Wang 《海军后勤学研究》1993,40(3):345-360
In this article we consider a single-server system whose customers arrive by appointments only. Both static and dynamic scheduling problems are studied. In static scheduling problems, one considers scheduling a finite number of customer arrivals, assuming there is no scheduled customer arrival to the system. In dynamic scheduling problems, one considers scheduling one customer arrival only, assuming that there are a number of scheduled customers already. The expected delay time is recursively computed in terms of customer interarrival times for both cases. The objective is to minimize the weighted customer delay time and the server completion time. The problem is formulated as a set of nonlinear equations. Various numerical examples are illustrated. © 1993 John Wiley & Sons, Inc. 相似文献
57.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
58.
59.
A large-scale simulation was conducted to investigate the statistical properties and the suitability of an estimator that estimates the coordinates of a three-dimensional source, according to the angles at which several observers view the source. The estimator uses a heuristical averaging method of estimates obtained from the solution of six two-dimensional problems that utilize line-to-point transformations. The estimator was found to be approximately unbiased with low standard deviations for normal error distributions. An effective and easy-to-use forecasting formula was developed to forecast the parameters of the distributions of the estimates. © 1994 John Wiley & Sons, Inc. 相似文献
60.
Defense contractors retain engineers for two reasons. First, engineers work on current-period production contracts. Second, engineers conduct independent research and development (IR&D) and write bids and proposals (B&P) for future contracts. The amount of IR&D/B&P activity, however, understates the amount of effort devoted to learning that reduces the cost of future production. Even some engineers who work on current-period production may engage in learning, as a by-product of their efforts. This article develops and implements a model for estimating the volume of learning activity undertaken by four large manufacturers of military aircraft. © 1994 John Wiley & Sons, Inc. 相似文献