全文获取类型
| 收费全文 | 457篇 |
| 免费 | 1篇 |
专业分类
| 458篇 |
出版年
| 2021年 | 11篇 |
| 2019年 | 11篇 |
| 2017年 | 12篇 |
| 2016年 | 10篇 |
| 2015年 | 12篇 |
| 2014年 | 9篇 |
| 2013年 | 81篇 |
| 2011年 | 3篇 |
| 2010年 | 4篇 |
| 2008年 | 4篇 |
| 2007年 | 5篇 |
| 2006年 | 6篇 |
| 2005年 | 5篇 |
| 2004年 | 4篇 |
| 2003年 | 3篇 |
| 2002年 | 9篇 |
| 2001年 | 6篇 |
| 2000年 | 5篇 |
| 1999年 | 4篇 |
| 1998年 | 10篇 |
| 1997年 | 8篇 |
| 1996年 | 5篇 |
| 1995年 | 6篇 |
| 1994年 | 8篇 |
| 1993年 | 9篇 |
| 1992年 | 7篇 |
| 1991年 | 10篇 |
| 1989年 | 9篇 |
| 1988年 | 16篇 |
| 1987年 | 6篇 |
| 1986年 | 15篇 |
| 1985年 | 12篇 |
| 1984年 | 7篇 |
| 1983年 | 6篇 |
| 1982年 | 4篇 |
| 1981年 | 9篇 |
| 1980年 | 7篇 |
| 1979年 | 11篇 |
| 1978年 | 7篇 |
| 1977年 | 7篇 |
| 1976年 | 3篇 |
| 1975年 | 11篇 |
| 1974年 | 9篇 |
| 1973年 | 6篇 |
| 1972年 | 7篇 |
| 1971年 | 7篇 |
| 1970年 | 4篇 |
| 1969年 | 7篇 |
| 1968年 | 4篇 |
| 1966年 | 3篇 |
排序方式： 共有458条查询结果，搜索用时 0 毫秒
241.
242.
We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n2) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n2) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013 相似文献
243.
A framework involving independent competing risks permits observing failures due to a specific cause and failures due to a competing cause, which constitute survival times from the cause of primary interest. Is observing more failures more informative than observing survivals? Intuitively, due to the definitiveness of failures, the answer seems to be the former. However, it has been shown before that this intuition holds when estimating the mean but not the failure rate of the exponential model with a gamma prior distribution for the failure rate. In this article, we address this question at a more general level. We show that for a certain class of distributions failures can be more informative than survivals for prediction of life length and vice versa for some others. We also show that for a large class of lifetime models, failure is less informative than survival for estimating the proportional hazards parameter with gamma, Jeffreys, and uniform priors. We further show that, for this class of lifetime models, on average, failure is more informative than survival for parameter estimation and for prediction. These results imply that the inferential purpose and properties of the lifetime distribution are germane for conducting life tests. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
244.
This paper models transnational terrorism as a three‐way strategic interaction involving a government that faces armed opposition at home, which may spill over in the form of acts of terrorism by the state's opponents against the government's external sponsor. The external sponsor also utilises deterrence against potential terrorists, which only lowers terrorism if terrorists are not intrinsically motivated by a deep‐seated sense of humiliation. The model highlights the importance of intrinsic motivation. A rise in the external power's preference for deterrence against terrorism may backfire in these circumstances. Increases in the government's military efficiency against the rebels, who are also terrorists against the government's sponsor, raises overall levels of violence. 相似文献
245.
We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015 相似文献
246.
It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015 相似文献
247.
Manjeet S. Pardesi 《The Nonproliferation Review》2014,21(3-4):337-354
The Indian nuclear program is a response to a perceived politico-strategic threat from China as opposed to a military-operational one that New Delhi began after perceiving an “ultimatum” from China in 1965. Consequently, India is in the process of acquiring an assured second-strike capability vis-à-vis China to meet the requirements of general deterrence. While India has always been concerned about the Sino-Pakistani nuclear/missile nexus, China has become wary of the growing military ties between the United States and India in recent years, especially because of the military implications of the US-India civil nuclear deal. Given the growing conventional military gap between the two states, India is not lowering its nuclear threshold to meet the Chinese conventional challenge. Instead, India is upgrading its conventional military strategy from dissuasion to deterrence against China. While the overall Sino-Indian nuclear relationship is stable, it will be challenged as China acquires advanced conventional weapons that blur the distinction between conventional and nuclear conflict. 相似文献
248.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
249.
This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
250.