首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   507篇
  免费   17篇
  国内免费   1篇
  2021年   5篇
  2020年   5篇
  2019年   12篇
  2018年   7篇
  2017年   14篇
  2016年   11篇
  2015年   7篇
  2014年   10篇
  2013年   123篇
  2012年   5篇
  2011年   6篇
  2010年   7篇
  2009年   6篇
  2008年   5篇
  2007年   6篇
  2006年   8篇
  2005年   6篇
  2003年   5篇
  2002年   5篇
  2001年   5篇
  2000年   5篇
  1998年   5篇
  1997年   7篇
  1996年   9篇
  1995年   8篇
  1994年   9篇
  1993年   11篇
  1992年   12篇
  1991年   15篇
  1989年   10篇
  1988年   7篇
  1987年   10篇
  1986年   10篇
  1985年   14篇
  1984年   7篇
  1982年   5篇
  1981年   5篇
  1980年   11篇
  1979年   7篇
  1978年   9篇
  1976年   8篇
  1975年   10篇
  1974年   10篇
  1973年   10篇
  1972年   5篇
  1971年   5篇
  1970年   8篇
  1969年   5篇
  1968年   7篇
  1967年   5篇
排序方式: 共有525条查询结果,搜索用时 15 毫秒
411.
Building regional security cooperation in the Western Hemisphere is not a strictly short-term, unilateral or bilateral defense effort. Regional security will only result from a long-term, cooperative, multilateral civil-military effort. A viable framework for success includes the need to advance hemispheric understanding of the security concerns of each country and those that the region as a whole faces (for example, the internal and external threat(s) to security). Finally, these issues and associated recommendations demand a carefully staffed and phased regional security plan of action, with measurable short- and long-term objectives to validate its planning and implementation. The basic directions for a regional security plan, as identified at the Miami conference, are as follow.  相似文献   
412.
413.
For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016  相似文献   
414.
James Char 《战略研究杂志》2016,39(5-6):608-636
ABSTRACT

Since emerging as China’s top leader following the 18th Party Congress, Xi Jinping has moved swiftly to consolidate his formal authority as Central Military Commission chairman over the Chinese People’s Liberation Army. In redressing the civil-military imbalance wrought by Dengist economic reforms, the commander-in-chief has combined institutional mechanisms with the use of fear to impose authoritative civilian control over the military. This paper proposes that a combination of changes to the Chinese strategic environment has contributed to Xi’s utility of the anti-corruption campaign to purge the regime’s coercive forces of its previous underpinnings, and advances that the war on military malfeasance has given rise to a new set of dynamics in civil-military relations in post-Reform China.  相似文献   
415.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016  相似文献   
416.
“Evergreening” is a strategy wherein an innovative pharmaceutical firm introduces an upgrade of its current product when the patent on this product expires. The upgrade is introduced with a new patent and is designed to counter competition from generic manufacturers that seek to imitate the firm's existing product. However, this process is fraught with uncertainty because the upgrade is subject to stringent guidelines and faces approval risk. Thus, an incumbent firm has to make an upfront production capacity investment without clarity on whether the upgrade will reach the market. This uncertainty may also affect the capacity investment of a competing manufacturer who introduces a generic version of the incumbent's existing product but whose market demand depends on the success or failure of the upgrade. We analyze a game where capacity investment occurs before uncertainty resolution and firms compete on prices thereafter. Capacity considerations that arise due to demand uncertainty introduce new factors into the evergreening decision. Equilibrium analysis reveals that the upgrade's estimated approval probability needs to exceed a threshold for the incumbent to invest in evergreening. This threshold for evergreening increases as the intensity of competition in the generic market increases. If evergreening is optimal, the incumbent's capacity investment is either decreasing or nonmonotonic with respect to low end market competition depending on whether the level of product improvement in the upgrade is low or high. If the entrant faces a capacity constraint, then the probability threshold for evergreening is higher than the case where the entrant is not capacity constrained. Finally, by incorporating the risk‐return trade‐off that the incumbent faces in terms of the level of product improvement versus the upgrade success probability, we can characterize policy for a regulator. We show that the introduction of capacity considerations may maximize market coverage and/or social surplus at incremental levels of product improvement in the upgrade. This is contrary to the prevalent view of regulators who seek to curtail evergreening involving incremental product improvement. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 71–89, 2016  相似文献   
417.
This study examines whether the exclusion of ethnic groups from political power is an important contributing factor to domestic terrorism. To empirically test this question, we employ a negative binomial regression estimation on 130 countries during the period from 1981 to 2005. We find that countries in which certain ethnic populations are excluded from political power are significantly more likely to experience domestic terrorist attacks and to suffer from terrorist casualties; furthermore, ethnic group political exclusion is a more consistent and substantive predictor of domestic terrorist activity than general political repression or economic discrimination.  相似文献   
418.
The transfer-line models in the literature are planning models rather than operational models. That is, they are very useful for planning or designing the transfer line, but are less useful for controlling the daily operation of the line. The performance measure used in these models is the efficiency of the line A. The expected number of units produced during a period of length T cycles is AT. In this article a procedure is presented for calculating the variance of the number of units produced by the transfer line during a period of length T cycles. These two performance measures can be used to construct an interval estimate for, say, the number of units produced during a shift. This interval estimate is an operational guide for the production manager.  相似文献   
419.
This article considers the dynamic lot-size problem under discounting, allowing speculative motive for holding inventory. A variable rolling-horizon procedure is presented, which, under certain regularity conditions, is guaranteed to generate an infinite-horizon optimal-production plan. We also discuss a fixed rolling-horizon procedure which provides a production plan that achieves an infinite-horizon cost within a user-specified tolerance ϵ of optimality. The fixed-horizon length T* needed in this procedure is given in terms of a closed-form formula that is independent of specific forecasted demands. We also present computational results for problems with a range of cost parameters and demand characteristics.  相似文献   
420.
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ jN, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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