首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   265篇
  免费   0篇
  265篇
  2021年   3篇
  2019年   10篇
  2018年   8篇
  2017年   5篇
  2016年   4篇
  2014年   6篇
  2013年   46篇
  2012年   3篇
  2010年   6篇
  2007年   6篇
  2006年   2篇
  2005年   6篇
  2004年   4篇
  2002年   7篇
  2000年   2篇
  1999年   4篇
  1998年   7篇
  1997年   7篇
  1996年   3篇
  1995年   2篇
  1994年   7篇
  1993年   9篇
  1992年   5篇
  1991年   7篇
  1990年   7篇
  1989年   5篇
  1988年   6篇
  1987年   3篇
  1986年   4篇
  1985年   6篇
  1984年   1篇
  1983年   2篇
  1982年   5篇
  1981年   5篇
  1980年   3篇
  1979年   4篇
  1978年   4篇
  1977年   3篇
  1976年   3篇
  1975年   3篇
  1974年   3篇
  1973年   4篇
  1972年   3篇
  1971年   1篇
  1969年   2篇
  1968年   5篇
  1967年   2篇
  1966年   3篇
  1949年   1篇
  1948年   2篇
排序方式: 共有265条查询结果,搜索用时 15 毫秒
151.
This article presents a mathematical model for manpower scheduling for unbalanced production lines in order to minimize in-process inventory cost. The model extends prior work by adding workers' skill limitations to the system. The model is formulated for a one-period schedule and then extended for multiperiod schedules. An example problem is solved for both single and multiperiods. A heuristic algorithm is also presented for multiperiod and large-scale problems, and computational experiences are reported.  相似文献   
152.
    
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
153.
    
In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
154.
155.
156.
157.
The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented.  相似文献   
158.
We consider groups of tests for personnel selection purposes in which each test has a known a priori probability of being failed, such failure resulting in outright rejection and termination of testing. Each test has a fixed cost and given duration. We consider the minimization of the total expected cost due to both the fixed costs and the delay costs when the tests may be conducted sequentially or in parallel. In the latter situation, a heuristic algorithm is proposed and illustrated.  相似文献   
159.
Book Reviews     
Strategic Geography. By Hugh Faringdon. Routledge, London (1989), ISBN 0-415-00980-4, £40.00

Field Artillery and Firepower. By J. B. A. Bailey. The Military Press, Oxford (1989), ISBN 0-85066-810-7, £25.00 (hardback), ISBN 0-85066-811-5, £14.50 (paperback)

U.S.-Soviet Security Cooperation. Edited by Alexander L. George, Philip J. Farley and Alexander Dallin. Oxford University Press, New York (1988), ISBN 0-19-505397-4, £30.00 (hardback), $19.95 (paperback)

Non-production by Industry of Chemical-warfare Agents: Technical Verification under a Chemical Weapons Convention. Edited by S. J. Lundin. SIPRI/Oxford University Press, Oxford (1988), ISBN 0-19-829129-9, £19.50

Ireland's Terrorist Trauma: Interdisciplinary Perspectives. Edited by Alan O'Day and Yonah Alexander. Harvester Wheatsheaf, Hemel Hempstead (1989), ISBN 7450-049003, £27.50 ($48.65)

Pilots and Rebels: the Use of Aircraft in Unconventional Warfare 1918-1988. By P. A. Towle. Brassey's (UK), London (1989), ISBN 0-08-036712-7, £29.95 ($53.95)  相似文献   
160.
    
ABSTRACT

Since 9/11, the United States has achieved notable gains against al Qaeda, and also Islamic State (IS), all while avoiding another mass-casualty attack at home. Yet, institutionally, culturally, and in its capabilities, the US government remains seriously ill-equipped for the task of countering irregular threats. Partly as a result, Islamist extremism shows no sign of being defeated, having instead metastasized since 9/11 and spread. Why, given the importance accorded to counterterrorism, has the US approach remained inadequate? What is impeding more fundamental reforms? The article evaluates the United States’ way of irregular warfare: its troubled engagement with counterinsurgency and its problematic search for lower cost and lower risk ways of combating terrorism. It suggests needed reforms but acknowledges also the unlikelihood of change.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号