首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   427篇
  免费   0篇
  427篇
  2021年   5篇
  2020年   5篇
  2019年   7篇
  2017年   9篇
  2016年   9篇
  2015年   8篇
  2014年   7篇
  2013年   68篇
  2011年   4篇
  2009年   4篇
  2007年   6篇
  2006年   3篇
  2005年   4篇
  2004年   7篇
  2003年   4篇
  2002年   6篇
  2001年   8篇
  2000年   4篇
  1999年   10篇
  1998年   9篇
  1997年   9篇
  1996年   7篇
  1995年   11篇
  1994年   13篇
  1993年   11篇
  1992年   12篇
  1991年   11篇
  1990年   6篇
  1989年   4篇
  1988年   10篇
  1987年   8篇
  1985年   8篇
  1984年   9篇
  1983年   8篇
  1982年   5篇
  1981年   9篇
  1980年   6篇
  1979年   11篇
  1978年   6篇
  1977年   5篇
  1976年   6篇
  1975年   8篇
  1974年   7篇
  1973年   6篇
  1972年   8篇
  1971年   6篇
  1970年   3篇
  1969年   3篇
  1968年   5篇
  1967年   4篇
排序方式: 共有427条查询结果,搜索用时 15 毫秒
351.
352.
353.
    
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017  相似文献   
354.
    
  相似文献   
355.
    
This essay reviews seven recent books and reports that focus upon the use of US armed drones in Pakistan's Federally Administered Tribal Areas (FATA). This essay synthesizes a historical account of the program, critically interrogates key arguments and evidence advanced by the authors, and draws attention the particular problems that confront those who live in the FATA and the second-class citizenship that the Pakistani state has bestowed upon them for reasons of domestic and foreign policy concerns. This review essay does not intend to be the final word on any of the ongoing policy debates. But it does hope to enable a wider audience to take part in these important deliberations.  相似文献   
356.
    
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016  相似文献   
357.
In a military intervention, do surges work? I compare the failed ‘surge’ in Vietnam, the repulse of the Easter Invasion in 1972, as a means of assessing the more ambiguous surges in Iraq and Afghanistan. I identify four features of a surge for this analysis: the military dimensions and strategy of the surging forces, the military capabilities of the host forces, the political vitality and will of the host country, and the political commitment in the domestic politics of the intervener. I find that the last feature is the most critical; and, in all three surges, the American political commitment was lacking.  相似文献   
358.
This article argues that since the advent of democracy, the South African Police Service (SAPS) has been plagued by poor administration. Having inherited a repressive police force, the post-apartheid national police commissioners (NPCs) have found it difficult to transform the organisation. Among the unintended consequences has been a rise in police deaths. Although police deaths can be attributed to numerous factors, this article focuses on fault lines in the SAPS administration through a strengths, weaknesses, opportunities and threats (SWOT) analysis drawing largely on existing scholarly debates. Essential theoretical perspectives have been employed to gain insight into the root causes of the problem. The article concludes that poor administration and a lack of trust, partnership and collaboration between police officers and community members have perpetuated the killing of police officers. These killings are further compounded by the flawed and ill-conceived selection and appointment of NPCs. As a consequence, the article recommends that the appointment of NPCs should be promptly reviewed. It further recommends that each potential candidate should have risen through the ranks and must fully comprehend the challenges facing the organisation.  相似文献   
359.
This article shows under which circumstances fraudulent accreditation can occur in Brazilian military hospitals, calling attention to the tone at the top as a critical aspect of military fraud deterrence – and hence as a critical aspect of this branch of military ethics. The problems allegedly found in Brazilian military health institutions were revealed through in-depth interviews conducted with 29 professionals who reported to work or have worked in a Brazilian military hospital. These fraud allegations were mostly associated with false documentation and procedures designed to give the appearance that legal requirements for accreditation were met and could be traced back to a weak or corrupt “tone at the top” coming from military higher ranks.  相似文献   
360.
    
We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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