全文获取类型
收费全文 | 633篇 |
免费 | 19篇 |
出版年
2021年 | 12篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 14篇 |
2013年 | 122篇 |
2009年 | 9篇 |
2007年 | 7篇 |
2006年 | 5篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 10篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 19篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 12篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 16篇 |
1990年 | 8篇 |
1989年 | 11篇 |
1988年 | 14篇 |
1987年 | 16篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 11篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 14篇 |
1978年 | 7篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 9篇 |
1974年 | 12篇 |
1973年 | 14篇 |
1972年 | 9篇 |
1971年 | 10篇 |
1970年 | 10篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有652条查询结果,搜索用时 15 毫秒
211.
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 相似文献
212.
A double-ended queue with a Poisson arrival pattern is examined in a situation where the rates depend (in a restricted sense) on both the time and the state of the system. Under some circumstances, the rates can be controlled. This article studies the distribution of the difference in queue sizes for each member of a large class of control strategies and introduces the problem of determining the optimal times at which the control should be in effect in order to maximize certain objective functions. 相似文献
213.
Richard M. Soland 《海军后勤学研究》1987,34(3):337-363
It is desired to select numbers of area and point interceptors that minimize the cost of such defensive missiles under the condition that the maximum total expected damage produced by an unknown number of attacking missiles A be bounded above by a given function of A. Area coverages may overlap. The attacker is assumed to know the numbers of area and point interceptors and to launch a simultaneous attack (of arbitrary size A) against all targets, which is optimal against the given defenses. The defender is assumed to observe the attack and then allocate his area and point interceptors against attacking missiles so as to minimize the total expected damage. Upper and lower bounds on the minimal cost are obtained by solving integer programming problems. 相似文献
214.
A numerical approach is presented for determining the waiting time distribution in a transient bulk-arrival, bulk-service queue. Vehicle departures from the queue are governed by a general dispatch strategy that includes holding with a variable release function and vehicle cancellations. The waiting time distribution of a customer (in a group) arriving at a given point in time is calculated by simulating the process in discrete time and determining at each step the probability the customer has left the system. The dispatch strategies require knowing the total length of the queue as well as the position a customer holds in the queue. An exact approach is compared to an accurate approximation which is 50 to 100 times faster. Comparisons are made with other approaches in the context of steady-state systems. 相似文献
215.
MacGregor and Harris (J Quality Technol 25 (1993) 106–118) proposed the exponentially weighted mean squared deviation (EWMS) and the exponentially weighted moving variance (EWMV) charts as ways of monitoring process variability. These two charts are particularly useful for individual observations where no estimate of variability is available from replicates. However, the control charts derived by using the approximate distributions of the EWMS and EWMV statistics are difficult to interpret in terms of the average run length (ARL). Furthermore, both control charting schemes are biased procedures. In this article, we propose two new control charts by applying a normal approximation to the distributions of the logarithms of the weighted sum of chi squared random variables, which are respectively functions of the EWMS and EWMV statistics. These new control charts are easy to interpret in terms of the ARL. On the basis of the simulation studies, we demonstrate that the proposed charts are superior to the EWMS and EWMV charts and they both are nearly unbiased for the commonly used smoothing constants. We also compare the performance of the proposed charts with that of the change point (CP) CUSUM chart of Acosta‐Mejia (1995). The design of the proposed control charts is discussed. An example is also given to illustrate the applicability of the proposed control charts. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
216.
For various parameter combinations, the logistic–exponential survival distribution belongs to four common classes of survival distributions: increasing failure rate, decreasing failure rate, bathtub‐shaped failure rate, and upside‐down bathtub‐shaped failure rate. Graphical comparison of this new distribution with other common survival distributions is seen in a plot of the skewness versus the coefficient of variation. The distribution can be used as a survival model or as a device to determine the distribution class from which a particular data set is drawn. As the three‐parameter version is less mathematically tractable, our major results concern the two‐parameter version. Boundaries for the maximum likelihood estimators of the parameters are derived in this article. Also, a fixed‐point method to find the maximum likelihood estimators for complete and censored data sets has been developed. The two‐parameter and the three‐parameter versions of the logistic–exponential distribution are applied to two real‐life data sets. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
217.
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 相似文献
218.
The rise of China has been fuelled by a massive military modernisation programme relying, in large part, on the acquisition of foreign military equipment. The question of how the world’s major powers define their arms transfer policies towards China is therefore crucially important. This article makes two original contributions. First, drawing on neoclassical realism, it proposes an explanatory framework integrating international and domestic factors to explain variations in major powers’ arms transfers. Second, based on a large body of elite interviews and diplomatic cables, it offers the first comprehensive comparison of American, British, French and Russian arms transfer policies towards China since the end of the Cold War. 相似文献
219.
The 22 September 1979 Vela Incident: Radionuclide and Hydroacoustic Evidence for a Nuclear Explosion
This article offers a new analysis of radionuclide and hydroacoustic data to support a low-yield nuclear weapon test as a plausible explanation for the still contentious 22 September 1979 Vela Incident, in which U.S. satellite Vela 6911 detected an optical signal characteristic of an atmospheric nuclear explosion over the Southern Indian or Atlantic Ocean. Based on documents not previously widely available, as well as recently declassified papers and letters, this article concludes that iodine-131 found in the thyroids of some Australian sheep would be consistent with them having grazed in the path of a potential radioactive fallout plume from a 22 September low-yield nuclear test in the Southern Indian Ocean. Further, several declassified letters and reports which describe aspects of still classified hydroacoustic reports and data favor the test scenario. The radionuclide and hydroacoustic data taken together with the analysis of the double-flash optical signal picked up by Vela 6911 that was described in a companion 2017 article (“The 22 September 1979 Vela Incident: The Detected Double-Flash”) can be traced back to sources with similar spatial and temporal origins and serve as a strong indicator for a nuclear explosion being responsible for the 22 September 1979 Vela Incident. 相似文献
220.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献