全文获取类型
收费全文 | 312篇 |
免费 | 6篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 57篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 6篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 3篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有318条查询结果,搜索用时 31 毫秒
81.
Darrell D. Perry 《海军后勤学研究》1985,32(1):17-19
MIL-STD-414 has been in existence in its original form since 1957. Obviously, there are some things that are right about 414. But there are some changes to the standard that are long overdue. This article presents some pros and cons of 414 and a recommendation that it be replaced by a MIL-STD-414A. Two concerns regarding ANSI/ASQC Z1.9 are discussed. 相似文献
82.
A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small- to moderate-sized randomly generated generalized set-packing models. Solutions are compared to those obtained using an existing well-regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low-density models in which the number of variables is large relative to the number of constraints. 相似文献
83.
84.
Jeffrey D. Simon 《Defense & Security Analysis》1998,14(3):331-333
85.
K. D. Glazebrook 《海军后勤学研究》1984,31(2):251-264
A single machine is available to process a collection of stochastic jobs. There may be technological constraints on the job set. The machine sometimes breaks down. Costs are incurred and rewards are earned during processing. We seek strategies for processing the jobs which maximize the total expected reward earned. 相似文献
86.
D. Siegmund 《海军后勤学研究》1979,26(1):57-67
One-sided sequential tests for the mean of an exponential distribution are proposed, and the related confidence intervals are computed. The tests behave like the classical sequential probability-ration test when the mean is small and like a fixed-time test when the mean is large and accurate estimation is important. 相似文献
87.
A Markovian model is presented for the development of an optimal repair-replacement policy for the situation requiring a decision only at failure. The problem is characterized by the presence of growth which is integrated into the formulation. The model is applied to an actual problem, with data analysis and results given. Substantial savings are indicated. 相似文献
88.
Hanif D. Sherali 《海军后勤学研究》1981,28(3):447-462
In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper. 相似文献
89.
This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given. 相似文献
90.
This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V-shaped. © 1997 John Wiley & Sons, Inc. 相似文献