全文获取类型
收费全文 | 630篇 |
免费 | 5篇 |
出版年
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 6篇 |
2017年 | 15篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 99篇 |
2012年 | 23篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 16篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2002年 | 9篇 |
2001年 | 5篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 4篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 14篇 |
1988年 | 6篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 9篇 |
1975年 | 9篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1972年 | 14篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 12篇 |
1968年 | 8篇 |
排序方式: 共有635条查询结果,搜索用时 15 毫秒
581.
Robert G. Brown 《海军后勤学研究》1968,15(2):281-286
A flexible simulation system has been designed to permit investigation of sequencing rules in a large job shop, with continual input of new work. The objective is to understand what happens rather than to find optimum rules, with many conflicting measures of effectiveness: work in process, finished goods investment, delays, machine and labor utilization, and effort to implement. A few problem areas have been explored. 相似文献
582.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators. 相似文献
583.
Let be a basic solution to the linear programming problem subject to: where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these “cuts” in a specified way yields a finite dual simplex algorithm for the pure integer programming problem. The relation of these modified Dantzig cuts to Gomory cuts is discussed. 相似文献
584.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when certain data of the problem are continuously varied as a linear function of a single parameter. First the rim conditions, then the cost coefficients, and finally the cell upper bounds are varied parametrically and the effect on the optimal solution, the associated change in costs and the dual changes are derived. Finally the effect of simultaneous changes in both cost coefficients and rim conditions are investigated. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum bases are preserved. 相似文献
585.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when any coefficient of any row constraint is continuously varied as a linear function of a single parameter. The entire analysis is divided into three parts. Results are derived relative to the cases when the coefficient under consideration is associated, to a cell where the optimal solution in that cell attains its lower bound or its upper bound. The discussion relative to the case when the coefficient under consideration is associated to a cell in the optimal basis is given in two parts. The first part deals with the primal changes of the optimal solution while the second part is concerned with the dual changes. It is shown that the optimal cost varies in a nonlinear fashion when the coefficient changes linearly in certain cases. The discussion in this paper is limited to basis-preserving operators for which the changes in the data are such that the optimum bases are preserved. Relevant algorithms and illustrations are provided throughout the paper. 相似文献
586.
This paper shows that by making use of an unusual property of the decision table associated with the dynamic programming solution to the goup problem, it is possible to dispense with table storage as such, and instead overlay values for both the objective and history functions. Furthermore, this storage reduction is accomplished with no loss in computational efficiency. An algorithm is presented which makes use of this technique and incorporates various additional efficiencies. The reduction in storage achieved for problems from the literature is shown. 相似文献
587.
This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed. 相似文献
588.
589.
Initial provisioning decisions (inventory stocking requirements) for low demand items often have to be made without much knowledge of what future demand rates will be. When the nature of an item is such that little demand for it is expected, the problem of whether to stock initially or risk not stocking the item is most critical. This report discusses this problem and presents decision procedures which can be used to handle this aspect of initial provisioning. The procedures relate an item's provisioning desirability to its provisioning characteristics, such as expected cost, expected resupply time, current information on its likely demand rate, and to an overall operating policy or criterion. The criterion function measures the total system degredation as a function of the events of having items out of stock when demand occurs. Several different policy functions are discussed and the provisioning decision rules which apply to each are presented. Demand rate information is handled through a Bayesian type approach. The decision rules presented in this report can be utilized to either determine stocking requirements within a budgetary constraint, or determine the relative stocking desirability on an item-by-item basis. 相似文献
590.