全文获取类型
收费全文 | 301篇 |
免费 | 14篇 |
国内免费 | 1篇 |
专业分类
316篇 |
出版年
2021年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 58篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有316条查询结果,搜索用时 0 毫秒
311.
Regardless of the outcome, civil wars are destructive events. They not only devastate the physical and human capital of a society, but also have a direct effect on state capacity. The capacity of the state is critical as it attempts to rebuild society and minimize the risk of a new civil conflict; yet, it is still not clear how civil war precisely affects state capacity. In general, we argue that incumbent victors are more likely to end with a stronger state when the conflict is short and the victory is decisive. In contrast, rebel victors require more time to build their internal capacity and thus have stronger states after a longer conflict, especially when they had access to lootable resources. 相似文献
312.
Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes 下载免费PDF全文
In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015 相似文献
313.
This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014 相似文献
314.
“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 相似文献
315.
Murat Güngör 《海军后勤学研究》2016,63(4):346-348
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 相似文献
316.
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 相似文献