全文获取类型
收费全文 | 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条查询结果,搜索用时 15 毫秒
241.
In this article the problem of minimizing the mean absolute deviation (MAD) of job completion times about an unrestricted given common due date with tolerance in the n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the unrestricted version of the MAD problem with an arbitrary due date tolerance is polynomial by proposing a polynomial-time algorithm for identifying an optimal schedule. © 1994 John Wiley & Sons, Inc. 相似文献
242.
Practitioners of maintenance scheduling sometimes use a simple analytic formula, derived based on inspection scheduling, as a heuristic to determine the length of the preventive maintenance period. The sensitivity of this heuristic solution is analyzed and the cost penalties are calculated compared to the exact solution that utilizes the lifetime distribution in the derivation of the optimal preventive maintenance period. A simple extension of the heuristic is suggested to improve the approximation with a slightly increased computational effort. The sensitivity and cost analysis of the improved heuristic are discussed as well. © 1994 John Wiley & Sons, Inc. 相似文献
243.
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc. 相似文献
244.
Emad-Eldin A. A. Aly 《海军后勤学研究》1993,40(5):633-642
We consider the problem of testing for the decreasing mean residual life ordering introduced in Kochar and Wiens [14]. We treat both the one-sample and two-sample problems. The limiting distributions of the proposed test statistics are derived. © 1993 John Wiley & Sons, Inc. 相似文献
245.
The system under study is a single item, two‐echelon production‐inventory system consisting of a capacitated production facility, a central warehouse, and M regional distribution centers that satisfy stochastic demand. Our objective is to determine a system base‐stock level which minimizes the long run average system cost per period. Central to the approach are (1) an inventory allocation model and associated convex cost function designed to allocate a given amount of system inventory across locations, and (2) a characterization of the amount of available system inventory using the inventory shortfall random variable. An exact model must consider the possibility that inventories may be imbalanced in a given period. By assuming inventory imbalances cannot occur, we develop an approximation model from which we obtain a lower bound on the per period expected cost. Through an extensive simulation study, we analyze the quality of our approximation, which on average performed within 0.50% of the lower bound. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 377–398, 2000 相似文献
246.
247.
Jihadist violence is typically associated with being particularly indiscriminate. Often, as in variations of the ‘new terrorism’ thesis, this characteristic is proposed to correspond in some way to its other attributes such as its globalised, decentralised and ‘postmodern’ religious nature. Recent work appears to give more substance to such claims, by claiming to show a relationship between indiscriminate violence and decentralised group organisation. However, in this paper we show, based on an analysis of jihadist targeting in Western Europe and America from 2001 to 2013, that targeting choices by jihadists unconnected to organised militant groups have in fact been consistently more, rather than less discriminate in their targeting choices than their better-integrated peers. Drawing on this finding, as well as a broader reading of jihadist targeting discourses, we argue for a more complex understanding of the relationship between radicalisation, extremist ideology, decentralisation, and targeting choice. 相似文献
248.
249.
It has been argued that the discovery of a new natural resource greatly increases the risk of conflict. This research aims to study the effect of natural resources on military spending, using the data from rentier states in the Middle East and North Africa (MENA) countries from 1987 to 2012. In considering the ‘resource curse,’ the types of natural resources matter. Our empirical results demonstrate that the ‘resource curse’ arising from the abundance of certain natural resources, particularly oil and forest resources, leads to increases in military spending. In contrast, the rent from coal and natural gas has a negative impact on military spending, while the rent from minerals has no impact on military spending, controlling for GDP growth and per capita income. 相似文献
250.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献