全文获取类型
收费全文 | 582篇 |
免费 | 9篇 |
专业分类
591篇 |
出版年
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 13篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 120篇 |
2009年 | 7篇 |
2007年 | 12篇 |
2005年 | 5篇 |
2004年 | 5篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 9篇 |
1993年 | 12篇 |
1992年 | 13篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 20篇 |
1988年 | 16篇 |
1987年 | 13篇 |
1986年 | 16篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 13篇 |
1973年 | 9篇 |
1972年 | 4篇 |
1971年 | 7篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1967年 | 7篇 |
1948年 | 4篇 |
排序方式: 共有591条查询结果,搜索用时 15 毫秒
71.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
72.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
73.
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997. 相似文献
74.
A probabilistic model is developed that applies to military bombardment, advertising for a mass audience, and other kinds of situations in which striking a target means that less of it is left to strike. The model provides the basis for decision analysis based on marginal gain in such circumstances. Heterogneous resources are considered as well as composite targets. All expenditures are quantized. The model has been developed as part of a computer-based military expert system, to replace a large complex set of expert opinions. In that application it sharply improves efficiency, yet conforms to major tenets of tactical doctrine. 相似文献
75.
John R. McNamara 《海军后勤学研究》1986,33(3):501-512
A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information. 相似文献
76.
Lawrence James 《Defense & Security Analysis》1985,1(2):143-144
The Face of Battle: by John Keegan. Jonathan Cape, London, 1976; Viking Press, New York, 1976; Penguin Books, Harmondsworth, 1978, 1983, 1984. 相似文献
77.
78.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas. 相似文献
79.
The production-location problem of a profit maximizing firm is considered. A model is developed for a single firm, facing the joint problems of determining the optimal plant location, the optimal input mix, and the optimal plant size. A homothetic production function is used as the model of the production technologies, and the existence of a sequential “separability” between the production, or input mix, problem and the location problem is demonstrated. 相似文献
80.