首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   389篇
  免费   0篇
  389篇
  2021年   5篇
  2019年   7篇
  2018年   5篇
  2017年   6篇
  2016年   7篇
  2015年   9篇
  2014年   8篇
  2013年   69篇
  2012年   7篇
  2011年   6篇
  2010年   7篇
  2007年   6篇
  2006年   7篇
  2004年   4篇
  2003年   5篇
  2002年   4篇
  2001年   3篇
  2000年   4篇
  1999年   6篇
  1998年   4篇
  1997年   5篇
  1996年   8篇
  1995年   5篇
  1994年   6篇
  1993年   10篇
  1992年   10篇
  1991年   8篇
  1990年   4篇
  1989年   9篇
  1988年   5篇
  1987年   7篇
  1986年   8篇
  1985年   10篇
  1984年   5篇
  1983年   4篇
  1982年   5篇
  1981年   4篇
  1980年   8篇
  1979年   7篇
  1978年   9篇
  1976年   7篇
  1975年   10篇
  1974年   6篇
  1973年   9篇
  1972年   5篇
  1971年   4篇
  1970年   5篇
  1969年   4篇
  1968年   5篇
  1967年   3篇
排序方式: 共有389条查询结果,搜索用时 0 毫秒
241.
Using the Solow–Swan growth model and the time‐trend included in the aggregate production function, this study applies the multivariate cointegration approach to re‐investigate the long‐run and causal relationships between defence expenditures and GDP while controlling for capital and labour input in Taiwan during the 1955–2002 period. It examines the long‐run causal relationship using the weak exogeneity test and utilizes general impulse response functions to determine whether a shock to defence expenditures affects economic growth or vice versa. Our findings provide substantive evidence in favour of the existence of a long‐run equilibrium cointegrated relationship between defence expenditures, GDP, labour and capital stock. The results of the weak exogeneity test indicate that a bi‐directional causal relationship exists in the long‐run between defence expenditures and GDP. Thus, the main policy implication that emerges from the long‐run results is that increasing defence expenditures in Taiwan is an effective means to boost overall economic performance and, with this improved economy, it should then be able to increase its defence expenditures further. Lastly, from our dynamic vector error correction model estimations, it is found that defence expenditures are a major means of adjusting for disequilibria that occur within the system.  相似文献   
242.
    

The aim of this paper is to indicate the extent to which the arms race against Turkey, in which Greece and Cyprus have been entangled, imposes a defence expenditure burden that is tough for the two allies to bear. To do so we have resorted to evaluating the optimal military expenditure for the two countries, allied in the context of the Integrated Defence Doctrine, which is compatible with the constraints imposed by the resources of their economies. All experiments and scenarios examined lead to the conclusion that the current defence burden of the two allies seems to be driving their economies beyond capacity limits. The fact remains, however, that under the circumstances, a one-sided disarmament policy like the one currently followed by Greece, is a risky choice given that the long-term armament programmes pursued by Turkey, whose role in this arms race has been proven as leading, leave very small room to the Greek and Cypriot sides to reduce their own defence expenditure.  相似文献   
243.
The defense establishments of all major powers are changing to reflect changes in the foundations of national security strategy and resource allocation. The authors believe economists should play an active role in formulating these changes and offer an orientation to the U.S. debate, presenting three major alternatives: the “Base Force” (Bush Administration), Mr. Aspin's Force “C,” and the “Low” Alternative (Prof. Kaufmann and Dr. Steinbruner). These alternatives are compared using first‐order measures of capabilities, budgets and risk. Budgetary estimates are based on newly‐developed analytical tools.  相似文献   
244.
    
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
245.
    
This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
246.
    
Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
247.
    
We study how changes to the composition and employment of the US Navy combat logistic force (CLF) influence our ability to supply our navy worldwide. The CLF consists of about 30 special transport ships that carry ship and aircraft fuel, ordnance, dry stores, and food, and deliver these to client combatant ships underway, making it possible for our naval forces to operate at sea for extended periods. We have modeled CLF operations to evaluate a number of transforming initiatives that simplify its operation while supporting an even larger number of client ships for a greater variety of missions. Our input is an employment schedule for navy battle groups of ships operating worldwide, extending over a planning horizon of 90–180 days. We show how we use optimization to advise how to sustain these ships. We have used this model to evaluate new CLF ship designs, advise what number of ships in a new ship class would be needed, test concepts for forward at‐sea logistics bases in lieu of conventional ports, demonstrate the effects of changes to operating policy, and generally try to show whether and how the CLF can support planned naval operations. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008  相似文献   
248.
This article concerns the scheduling of n jobs around a common due date, so as to minimize the average total earliness plus total lateness of the jobs. Optimality conditions for the problem are developed, based on its equivalence to an easy scheduling problem. It seems that this problem inherently has a huge number of optimal solutions and an algorithm is developed to find many of them. The model is extended to allow for the availability of multiple parallel processors and an efficient algorithm is developed for that problem. In this more general case also, the algorithm permits great flexibility in finding an optimal schedule.  相似文献   
249.
    
We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
250.
    
We consider two opponents that compete in developing asymmetric technologies where each party's technology is aimed at damaging (or neutralizing) the other's technology. The situation we consider is different than the classical problem of commercial R&D races in two ways: First, while in commercial R&D races the competitors compete over the control of market share, in our case the competition is about the effectiveness of technologies with respect to certain capabilities. Second, in contrast with the “winner‐takes‐all” assumption that characterizes much of the literature on this field in the commercial world, we assume that the party that wins the race gains a temporary advantage that expires when the other party develops a superior technology. We formulate a variety of models that apply to a one‐sided situation, where one of the two parties has to determine how much to invest in developing a technology to counter another technology employed by the other party. The decision problems are expressed as (convex) nonlinear optimization problems. We present an application that provides some operational insights regarding optimal resource allocation. We also consider a two‐sided situation and develop a Nash equilibrium solution that sets investment values, so that both parties have no incentive to change their investments. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 128–145, 2012  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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