全文获取类型
收费全文 | 253篇 |
免费 | 5篇 |
出版年
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 2篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 44篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 6篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 5篇 |
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篇 |
1949年 | 1篇 |
排序方式: 共有258条查询结果,搜索用时 31 毫秒
71.
72.
Satya D. Dubey 《海军后勤学研究》1966,13(2):113-128
Test functions, based on various types of censored and noncensored data, for testing several hypotheses about the location, the scale, and the shape parameters of the Weibull distributions are proposed. The exact sampling distributions of these test statistics are derived and their properties in special cases are discussed. A numerical example is considered to illustrate the application of the test functions. The results of this paper possess good possibility of wide application in view of the fact that hosts of real data arising from diverse fields of human endeavor are adequately described by the Weibull distribution. 相似文献
73.
74.
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. 相似文献
75.
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. 相似文献
76.
77.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
78.
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
79.
Jeffrey D. Simon 《Defense & Security Analysis》1998,14(3):331-333
80.
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. 相似文献