全文获取类型
收费全文 | 476篇 |
免费 | 5篇 |
专业分类
481篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 9篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 88篇 |
2010年 | 4篇 |
2009年 | 6篇 |
2008年 | 9篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 12篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1991年 | 14篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 14篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 12篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 5篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 6篇 |
1966年 | 6篇 |
排序方式: 共有481条查询结果,搜索用时 7 毫秒
151.
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
152.
153.
154.
A rule that constrains decision‐makers is enforced by an inspector who is supplied with a fixed level of inspection resources—inspection personnel, equipment, or time. How should the inspector distribute its inspection resources over several independent inspectees? What minimum level of resources is required to deter all violations? Optimal enforcement problems occur in many contexts; the motivating application for this study is the role of the International Atomic Energy Agency in support of the Treaty on the Non‐Proliferation of Nuclear Weapons. Using game‐theoretic models, the resource level adequate for deterrence is characterized in a two‐inspectee problem with inspections that are imperfect in the sense that violations can be missed. Detection functions, or probabilities of detecting a violation, are assumed to be increasing in inspection resources, permitting optimal allocations over inspectees to be described both in general and in special cases. When detection functions are convex, inspection effort should be concentrated on one inspectee chosen at random, but when they are concave it should be spread deterministicly over the inspectees. Our analysis provides guidance for the design of arms‐control verification operations, and implies that a priori constraints on the distribution of inspection effort can result in significant inefficiencies. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
155.
In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014 相似文献
156.
157.
158.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout. 相似文献
159.
In an earlier article we showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines intersect at a single point. In this article we extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities. 相似文献
160.