全文获取类型
收费全文 | 652篇 |
免费 | 32篇 |
国内免费 | 1篇 |
出版年
2021年 | 7篇 |
2019年 | 10篇 |
2018年 | 9篇 |
2017年 | 18篇 |
2016年 | 12篇 |
2015年 | 14篇 |
2014年 | 12篇 |
2013年 | 134篇 |
2011年 | 11篇 |
2010年 | 11篇 |
2009年 | 18篇 |
2008年 | 7篇 |
2007年 | 14篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 14篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 13篇 |
1997年 | 13篇 |
1996年 | 11篇 |
1995年 | 18篇 |
1994年 | 16篇 |
1993年 | 15篇 |
1992年 | 15篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 12篇 |
1987年 | 12篇 |
1985年 | 10篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 12篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 11篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
1971年 | 7篇 |
1968年 | 5篇 |
1967年 | 5篇 |
排序方式: 共有685条查询结果,搜索用时 15 毫秒
581.
We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000 相似文献
582.
59式坦克和62式坦克炮塔方向机,在使用中多次出现过不自锁现象,针对这种情况,从设计上找出了原因,提出了防止不自锁的措施,并对改进的第二代、第三代炮塔方向机自锁情况进行了剖析. 相似文献
583.
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 相似文献
584.
外军预警装备现状及发展趋势 总被引:1,自引:0,他引:1
为了应对大规模远距离空袭,各国都非常重视预警装备的发展,以期提高探测高空和低空目标的能力,提高对付复杂电磁环境的能力.简要介绍了国外预警装备现状及发展趋势. 相似文献
585.
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 相似文献
586.
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 相似文献
587.
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 相似文献
588.
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. 相似文献
589.
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. 相似文献
590.
The inventory-routing problem is a distribution problem in which each customer maintains a local inventory of a product such as heating oil and consumes a certain amount of that product each day. Given a central supplier, the objective is to minimize the annual delivery costs while attempting to insure that no customer runs out of the commodity at any time. In this article we present a procedure for reducing the long-term version of this problem to a single-period problem, which can be attacked using standard routing algorithms. The reduction procedure involves the definition of single-period costs that reflect long-term costs, the definition of a safety stock level and a specification of the customer subset to be considered during a single period. 相似文献