全文获取类型
收费全文 | 731篇 |
免费 | 17篇 |
出版年
2021年 | 7篇 |
2019年 | 17篇 |
2018年 | 13篇 |
2017年 | 17篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2013年 | 134篇 |
2011年 | 9篇 |
2010年 | 7篇 |
2009年 | 10篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 16篇 |
2004年 | 14篇 |
2003年 | 9篇 |
2000年 | 10篇 |
1999年 | 9篇 |
1998年 | 7篇 |
1997年 | 11篇 |
1996年 | 20篇 |
1995年 | 6篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 24篇 |
1990年 | 9篇 |
1989年 | 17篇 |
1988年 | 9篇 |
1987年 | 17篇 |
1986年 | 18篇 |
1985年 | 22篇 |
1984年 | 12篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 13篇 |
1979年 | 10篇 |
1978年 | 10篇 |
1977年 | 13篇 |
1976年 | 12篇 |
1975年 | 7篇 |
1974年 | 16篇 |
1973年 | 10篇 |
1972年 | 17篇 |
1971年 | 17篇 |
1970年 | 10篇 |
1969年 | 10篇 |
1968年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有748条查询结果,搜索用时 46 毫秒
41.
The classical Economic Order Quantity Model requires the parameters of the model to be constant. Some EOQ models allow a single parameter to change with time. We consider EOQ systems in which one or more of the cost or demand parameters will change at some time in the future. The system we examine has two distinct advantages over previous models. One obvious advantage is that a change in any of the costs is likely to affect the demand rate and we allow for this. The second advantage is that often, the times that prices will rise are fairly well known by announcement or previous experience. We present the optimal ordering policy for these inventory systems with anticipated changes and a simple method for computing the optimal policy. For cases where the changes are in the distant future we present a myopic policy that yields costs which are near-optimal. In cases where the changes will occur in the relatively near future the optimal policy is significantly better than the myopic policy. 相似文献
42.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
43.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
44.
Charles A. Holloway 《海军后勤学研究》1977,24(2):377-380
Using the general computational strategy of restriction, necessary conditions for optimality provide an alternative criterion for entering variables when degeneracies arises in linear programming problems. Although cycling may still occur, it is shown that if it is possible to make progress at the next iteration, the criterion is guaranteed to identify a non-basic variable which increases the value of the basic solution, thereby reducing stalling. An alternative method for determining variables to exit the basis when degeneracies occur is also suggested. 相似文献
45.
In this note we analyze the fractional interval programming problem (FIP) and find, explicitly, all its optimal solutions. Though our results are essentially the same as those in Charnes and Cooper [4], the proofs and analysis we provide here are considerably simpler. 相似文献
46.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
47.
A Linear Fractional Interval Programming problem (FIP) is the problem of extremizing a linear fractional function subject to two-sided linear inequality constraints. In this paper we develop an algorithm for solving (FIP) problems. We first apply the Charnes and Cooper transformation on (FIP) and then, by exploiting the special structure of the pair of (LP) problems derived, the algorithm produces an optimal solution to (FIP) in a finite number of iterations. 相似文献
48.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献
49.
Stochastic combat models are more realistic than either deterministic or exponential models. Stochastic combat models have been solved analytically only for small combat sizes. It is very difficult, if not impossible, to extend previous solution techniques to larger-scale combat. This research provides the solution for many-on-many heterogeneous stochastic combat with any break points. Furthermore, every stage in stochastic combat is clearly defined and associated aiming and killing probabilities are calculated. © 1996 John Wiley & Sons, Inc. 相似文献
50.
Silverman's game on (1, B) × (1, B) was analyzed by R. J. Evans, who showed that optimal strategies exist (and found them) only on a set of measure zero in the parameter plane. We examine the corresponding game on (1, B) × (1, D) with D > B, and show that optimal strategies exist in about half the parameter plane. Optimal strategies and game value are obtained explicitly. © 1995 John Wiley & Sons, Inc. 相似文献