全文获取类型
收费全文 | 736篇 |
免费 | 24篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 22篇 |
2018年 | 18篇 |
2017年 | 15篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 17篇 |
2013年 | 138篇 |
2012年 | 5篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 11篇 |
2005年 | 11篇 |
2004年 | 11篇 |
2003年 | 10篇 |
2002年 | 14篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 14篇 |
1997年 | 18篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 19篇 |
1993年 | 19篇 |
1992年 | 17篇 |
1991年 | 19篇 |
1990年 | 16篇 |
1989年 | 12篇 |
1986年 | 10篇 |
1985年 | 16篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1981年 | 13篇 |
1980年 | 10篇 |
1979年 | 17篇 |
1978年 | 11篇 |
1977年 | 8篇 |
1976年 | 11篇 |
1975年 | 13篇 |
1974年 | 15篇 |
1973年 | 11篇 |
1972年 | 12篇 |
1971年 | 11篇 |
1970年 | 6篇 |
1969年 | 9篇 |
1968年 | 13篇 |
1967年 | 6篇 |
1966年 | 5篇 |
排序方式: 共有761条查询结果,搜索用时 15 毫秒
71.
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. 相似文献
72.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
73.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
74.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
75.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
76.
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. 相似文献
77.
A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included. 相似文献
78.
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. 相似文献
79.
Charles H. Heider 《海军后勤学研究》1973,20(4):699-724
The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer-aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question- how close to optimal are the near optimal solutions- is examined. 相似文献
80.
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. 相似文献