全文获取类型
收费全文 | 507篇 |
免费 | 19篇 |
出版年
2021年 | 5篇 |
2019年 | 11篇 |
2018年 | 11篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2014年 | 10篇 |
2013年 | 108篇 |
2011年 | 4篇 |
2009年 | 4篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 13篇 |
1994年 | 14篇 |
1993年 | 11篇 |
1992年 | 13篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1985年 | 10篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 9篇 |
1973年 | 9篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有526条查询结果,搜索用时 15 毫秒
441.
In a recent paper, Teng, Chern, and Yang consider four possible inventory replenishment models and determine the optimal replenishment policies for them. They compare these models to identify the best alternative on the basis of minimum total relevant inventory costs. The total cost functions for Model 1 and Model 4 as derived by them are not exact for the comparison. As a result, their conclusion on the least expensive replenishment policy is incorrect. The present article provides the actual total costs for Model 1 and Model 4 to make a correct comparison of the four models. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 602–606, 2000 相似文献
442.
A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown that the solution for the illustrative problem is reasonably robust to rather large variations in the measure of value. We cannot, however, conclude that this would be the case in general. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 18–40, 2001 相似文献
443.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献
444.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999 相似文献
445.
This article considers the dynamic lot-size problem under discounting, allowing speculative motive for holding inventory. A variable rolling-horizon procedure is presented, which, under certain regularity conditions, is guaranteed to generate an infinite-horizon optimal-production plan. We also discuss a fixed rolling-horizon procedure which provides a production plan that achieves an infinite-horizon cost within a user-specified tolerance ϵ of optimality. The fixed-horizon length T* needed in this procedure is given in terms of a closed-form formula that is independent of specific forecasted demands. We also present computational results for problems with a range of cost parameters and demand characteristics. 相似文献
446.
This study examines critically the various assumptions, results, and concepts that exist to date in the literature and scientific community concerning the relationships among the Lanchester, stochastic Lanchester, and the general renewal models of combat. Many of the prevailing understandings are shown to be erroneous. 相似文献
447.
448.
Thomas P. Cavanna 《战略研究杂志》2018,41(4):576-603
How much does the United States care about nonproliferation? Recent scholarship suggests that the fear of spreading nuclear weapons was central to the US grand strategy in the Cold War. In one important case, however, this argument does not hold. This article draws on theoretical debates and newly declassified archives to demonstrate the primacy of geopolitics over nonproliferation in Washington’s policy toward India and Pakistan. Despite their rhetoric, Democratic and Republican leaders consistently relegated nonproliferation to the backburner whenever it conflicted with other strategic goals. Moreover, they inadvertently encouraged proliferation in South Asia at three inter-connected levels: technology, security, and identity. 相似文献
449.
Thomas Sloan 《海军后勤学研究》2008,55(2):116-129
In many manufacturing environments, equipment condition has a significant impact on product quality, or yield. This paper presents a semi‐Markov decision process model of a single‐stage production system with multiple products and multiple maintenance actions. The model simultaneously determines maintenance and production schedules, accounting for the fact that equipment condition affects the yield of each product differently. It extends earlier work by allowing the expected time between decision epochs to vary by both action and machine state, by allowing multiple maintenance actions, and by treating the outcome of maintenance as less than certain. Sufficient conditions are developed that ensure the monotonicity of both the optimal production and maintenance actions. While the maintenance conditions closely resemble previously studied conditions for this type of problem, the production conditions represent a significant departure from earlier results. The simultaneous solution method is compared to an approach commonly used in industry, where the maintenance and production problems are treated independently. Solving more than one thousand test problems confirms that the combination of both features of the model—accounting for product differences and solving the problems simultaneously—has a significant impact on performance. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
450.
In this article we apply perturbation analysis (PA), combined with conditional Monte Carlo, to obtain derivative estimators of the expected cost per period with respect to s and S, for a class of periodic review (s, S) inventory systems with full backlogging, linear holding and shortage costs, and where the arrivals of demands follow a renewal process. We first develop the general form of four different estimators of the gradient for the finite-horizon case, and prove that they are unbiased. We next consider the problem of implementing our estimators, and develop efficient methodologies for the infinite-horizon case. For the case of exponentially distributed demand interarrival times, we implement our estimators using a single sample path. Generally distributed interarrival times are modeled as phase-type distributions, and the implementation of this more general case requires a number of additional off-line simulations. The resulting estimators are still efficient and practical, provided that the number of phases is not too large. We conclude by reporting the results of simulation experiments. The results provide further validity of our methodology and also indicate that our estimators have very low variance. © 1994 John Wiley & Sons, Inc. 相似文献