全文获取类型
收费全文 | 651篇 |
免费 | 17篇 |
出版年
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 7篇 |
2013年 | 119篇 |
2011年 | 7篇 |
2009年 | 10篇 |
2007年 | 8篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 14篇 |
1995年 | 13篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 23篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 11篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 8篇 |
1972年 | 16篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 8篇 |
1967年 | 10篇 |
1966年 | 5篇 |
排序方式: 共有668条查询结果,搜索用时 15 毫秒
81.
This paper studies capacity expansions for a production facility that faces uncertain customer demand for a single product family. The capacity of the facility is modeled in three tiers, as follows. The first tier consists of a set of upper bounds on production that correspond to different resource types (e.g., machine types, categories of manpower, etc.). These upper bounds are augmented in increments of fixed size (e.g., by purchasing machines of standard types). There is a second‐tier resource that constrains the first‐tier bounds (e.g., clean room floor space). The third‐tier resource bounds the availability of the second‐tier resource (e.g., the total floor space enclosed by the building, land, etc.). The second and third‐tier resources are expanded at various times in various amounts. The cost of capacity expansion at each tier has both fixed and proportional elements. The lost sales cost is used as a measure for the level of customer service. The paper presents a polynomial time algorithm (FIFEX) to minimize the total cost by computing optimal expansion times and amounts for all three types of capacity jointly. It accommodates positive lead times for each type. Demand is assumed to be nondecreasing in a “weak” sense. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
82.
83.
Roger C. Schroeder 《海军后勤学研究》1974,21(3):375-388
Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results. 相似文献
84.
Least squares estimators of the parameters of the generalized Eyring Model are obtained by using data from censored life tests conducted at several accelerated environments. These estimators are obtained after establishing that the Gauss-Markov conditions for least squares estimation are satisfied. Confidence intervals for the hazard rate at use conditions are obtained after empirically showing that the logarithm of the estimate of the hazard rate at use conditions is approximately normally distributed. The coverage probabilities of the confidence intervals are also verified by a Monte Carlo experiment. The techniques are illustrated by an application to some real data. 相似文献
85.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献
86.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献
87.
Kailash C. Kapur 《海军后勤学研究》1973,20(4):639-644
Necessary and sufficient conditions for max-min problems are given here. In addition to characterization of directional derivatives of the relevant functions, subdifferentiability set for such functions is characterized. 相似文献
88.
David E. Thompson 《海军后勤学研究》1972,19(1):145-148
The reliability of weapons in combat has been treated by Bhashyam in the context of a stochastic duel characterized by fixed ammunition supplies. negative exponentially distributed firing times and weapon lifetimes, and a fixed number of spare weapons for each duelist. The present paper takes a different approach by starting with the fundamental duel of Ancker and Williams, characterized by unlimited ammunition and by ordinary renewal firing times, and adding to it weapon lifetimes which can be functions of time or of round position in the firing sequence. Probabilities of winning and tieing are derived and it is shown that under certain conditions the weapon lifetimes are equivalent to random time and ammunition limits. 相似文献
89.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献
90.
This article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem. 相似文献