全文获取类型
收费全文 | 194篇 |
免费 | 9篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 68篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有203条查询结果,搜索用时 218 毫秒
81.
In this article the problem of minimizing the mean absolute deviation (MAD) of job completion times about an unrestricted given common due date with tolerance in the n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the unrestricted version of the MAD problem with an arbitrary due date tolerance is polynomial by proposing a polynomial-time algorithm for identifying an optimal schedule. © 1994 John Wiley & Sons, Inc. 相似文献
82.
Michael Tkacik 《Defense & Security Analysis》2018,34(4):321-344
ABSTRACTThe slow moving conflict in the South China Sea has been characterized by some as “not worth the candle.” China claims the entirety of the South China Sea pursuant to a nine-dash line, the legal impact of which has been limited by international courts. At the same time, China has changed the reality of control over the South China Sea by building a number of fortified islands in the Spratly Islands and elsewhere. The US has either refused to stand up to China's behavior (Obama) or responded unevenly (Trump). This paper examines the impact of China's behaviour on local parties, US interests, and the liberal international system. 相似文献
83.
Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy. 相似文献
84.
The global financial turmoil of 2008 has resulted in the curtailment of military expenditure in most western countries. At a sub-regional-level reductions in the level of activity at a major military facility can have significant economic impact. In the light of this, the paper has two objectives: to analyse the impact of the decision to terminate naval shipbuilding at the United Kingdom’s Portsmouth Naval Base; and, for illustrative purposes, to examine the possible economic consequences of further contraction at the facility. In pursuit of these aims, it is necessary to establish the output, income and employment generated by the base using a bespoke input–output model. The methodology employed can, with appropriate adjustments, be utilised in other military or civilian contexts. 相似文献
85.
Michael S. Curl 《Arms and Armour》2019,16(1):27-55
Despite the lance’s status and the amount of attention the couched lance has received in historiography, study of its martial art has been neglected. The various lance types and techniques used by western European cavalry have only recently begun to receive scholarly attention. Additionally, Medieval European lance use has too often been studied in isolation, without an adequate understanding of the idiosyncratic and asymmetrical dynamics of mounted combat. Although the charge with the couched lance was a valid tactic, it was only one of many. Light and heavy lances were used in one hand or two to trip, block, unhorse, and wrestle. These techniques were governed by the harsh laws of distance, speed, impact, iron, and asymmetry. By utilizing the surviving Fechtbücher and several Peninsular and Near Eastern sources, a brief foray into the diverse techniques of lance use and their purposes has been attempted here. 相似文献
86.
87.
Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
88.
We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time pi to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of ni units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
89.
We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
90.