全文获取类型
收费全文 | 714篇 |
免费 | 14篇 |
专业分类
728篇 |
出版年
2020年 | 6篇 |
2019年 | 17篇 |
2018年 | 11篇 |
2017年 | 22篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 18篇 |
2013年 | 162篇 |
2012年 | 7篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 11篇 |
1991年 | 17篇 |
1990年 | 11篇 |
1989年 | 16篇 |
1988年 | 17篇 |
1987年 | 16篇 |
1986年 | 20篇 |
1985年 | 13篇 |
1984年 | 10篇 |
1983年 | 7篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 8篇 |
1972年 | 10篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 6篇 |
1967年 | 6篇 |
排序方式: 共有728条查询结果,搜索用时 0 毫秒
321.
We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
322.
In this paper, we discuss two‐dimensional failure modeling for a system where degradation is due to age and usage. We extend the concept of minimal repair for the one‐dimensional case to the two‐dimensional case and characterize the failures over a two‐dimensional region under minimal repair. An application of this important result to a manufacturer's servicing costs for a two‐dimensional warranty policy is given and we compare the minimal repair strategy with the strategy of replacement of failure. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
323.
324.
325.
The gas turbine engine is used to power many different types of commercial and military aircraft. During the scheduled maintenance of these engines, many of the turbine components are replaced. Of particular importance to us is the replacement of nozzle guide vanes in the nozzle assembly section of the engine. Individual vanes are selected from inventory to make up sets, and each set must meet certain characteristics in order to be feasible. The vanes in each set must then be sequenced in order to meet additional criteria. In this article, we give heuristics for the above partitioning and sequencing problems. Empirical analyses, using actual data from a branch of the armed services and a major engine manufacturer, are used to evaluate the proposed heuristics. The results of these analyses indicate that the heuristics are effective. 相似文献
326.
Much research been devoted to modeling the replacement problem under incomplete state information. Almost no work has been done on the maintenance problem under incomplete information with multiple maintenance actions that may not return the system to as good as new. We model this problem and derive structural results concerning the optimal maintenance policy. For the case where the effect of maintenance actions is state dependent, we give conditions under which the optimal policy is finitely computable. Where maintenance is state independent we show a specific structure, consisting of monotonic waiting times and constant maintenance actions, to be optimal. 相似文献
327.
Theodor J. Stewart 《海军后勤学研究》1988,35(6):719-731
This article describes an attempt to use certain multiple-criteria decision-making aids to support the formulation of catch quota policies in pelagic fisheries management. A set of attributes was identified, as necessary to represent the decision-making goals. Potentially useful methods appeared to be STEM, interactive sequential goal programming (ISGP), and interactive multiple goal programming (IMGP). Prototype microcomputer-based systems were developed to implement each of the three approaches. Although experience with the implementation is still relatively limited, it has involved actual planners and decision makers from both the fishing industry and from the relevant state department. The evidence is that IMGP is particularly useful in this context, and that it does seem to facilitate the reaching of consensus between different interest groups. 相似文献
328.
329.
330.
Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999 相似文献