全文获取类型
收费全文 | 911篇 |
免费 | 28篇 |
出版年
2020年 | 8篇 |
2019年 | 18篇 |
2017年 | 24篇 |
2016年 | 17篇 |
2015年 | 22篇 |
2014年 | 21篇 |
2013年 | 171篇 |
2011年 | 8篇 |
2010年 | 10篇 |
2009年 | 15篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 13篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 20篇 |
1997年 | 15篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 27篇 |
1993年 | 22篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 20篇 |
1987年 | 22篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 15篇 |
1976年 | 12篇 |
1975年 | 13篇 |
1974年 | 15篇 |
1973年 | 12篇 |
1972年 | 17篇 |
1971年 | 10篇 |
1970年 | 11篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 9篇 |
排序方式: 共有939条查询结果,搜索用时 15 毫秒
881.
It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed. 相似文献
882.
Manish C. Bhattacharjee 《海军后勤学研究》1981,28(2):341-345
For the classical disposal model for selling an asset with unknown price distribution which is NWUE (new worse than used in expectation) with a given finite mean price, this note derives a policy which is maximin. The gain in using the maximin policy relative to the option of selling right away is convex decreasing in the continuation cost to mean price ratio. The relevant results of Derman, Lieberman and Ross also follow as a consequence of our analysis. Our theorem provides a practical justification of their main result on the cutoff bid for the disposal model subject to NWUE pricing. 相似文献
883.
The stochastic duel is extended to include the possibility of a near-miss on each round fired, which causes the opponent to displace. During displacement, the displacing contestant cannot return the fire but is still a target for his opponent. An alternative interpretation of this model is to consider the displacement time as the time a contestant's fire is suppressed by his opponent's fire and that he does not move, but merely ceases fire temporarily. All times are exponentially distributed. 相似文献
884.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
885.
The objective of a diagnostic analysis is to provide a measure of performance of an existing system and estimate the benefits of implementing a new one, if necessary. Firms expect diagnostic studies to be done promptly and inexpensively. Consequently, collection and manipulation of large quantities of data are prohibitive. In this paper we explore aggregate optimization models as tools for diagnostic analysis of inventory systems. We concentrate on the dynamic lot size problem with a family of items sharing the same setup, and on the management of perishable items. We provide upper and lower bounds on the total cost to be expected from the implementation of appropriate systems. However, the major thrust of the paper is to illustrate an approach to analyze inventory systems that could be expanded to cover a wide variety of applications. A fundamental by-product of the proposed diagnostic methodology is to identify the characteristics that items should share to be aggregated into a single family. 相似文献
886.
This paper discusses situations in which the distribution of a lifetime response variable T is taken to depend upon a vector x of regressor variables. We specifically consider the case in which T, given x , has an exponential distribution, and in which x represents levels of fixed factors in an experimental design. Methods of analyzing data under this type of model are discussed, with maximum likelihood and least squares methods being presented and compared. 相似文献
887.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献
888.
Behram J. Hansotia 《海军后勤学研究》1980,27(2):257-272
We consider here stochastic linear programs with simple recourse when all the elements of the technology matrix and the resource vector have certain specific distributions. The distributions considered are the Normal, Exponential and Erlang. For the first two instances we extend the equivalent deterministic program to include the variance of the recourse. Finally, a simple example is given to illustrate the application of the formulas for the Erlang case. 相似文献
889.
During basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump. 相似文献
890.