全文获取类型
收费全文 | 586篇 |
免费 | 16篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 5篇 |
2017年 | 18篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 16篇 |
2013年 | 117篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 5篇 |
2002年 | 11篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 15篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 17篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有602条查询结果,搜索用时 296 毫秒
471.
Simon J. Moody 《战略研究杂志》2017,40(6):817-838
This article argues that the perceived need by NATO to nurture political cohesion within the Alliance during the 1950s resulted in the adoption of strategic concepts that were out-of-step with the military environment in which it was operating. It maintains that the Alliance acquiesced to American leadership on nuclear issues which led to the development of tactical nuclear capabilities at the expense of conventional war-fighting capabilities for the defence of the European Central Front. This resulted in a strategic concept that enhanced political cohesion but was militarily unviable. 相似文献
472.
473.
Contemporary network organizational structures have gradually developed over the last decades of the twentieth century. These new structures are challenging the traditional hierarchical structure form in a number of venues. In conflict and war, they made their potentials unequivocally known on 11 September 2001 via Al Qaeda's strategic suicide bombings against the United States. To better understand the military potentials of networks, an operational combat analysis of the Al Qaeda network was conducted. This analysis, a modification of weapons systems analysis, focused on network speed, along with offensive, defensive and combat multiplier attributes. Such analysis allows for a better understanding of the military capabilities and vulnerabilities of non-state OPFORs (opposing forces) and our own emergent counter-insurgency networks. 相似文献
474.
When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003. 相似文献
475.
In this paper we analyze a two‐period supply contract which allows for order adjustment by the buyer. The buyer is required to place orders for two periods. After observing initial demand, the buyer is then allowed to adjust the second order, paying a per unit order adjustment penalty. We describe the optimal behavior of the buyer under such a contract, both in determining the initial order quantities and in subsequently adjusting the order. We compare the solution to a contract where no adjustment is allowed and to the case where adjustment is allowed without penalty. We demonstrate that flexible contracts can reduce the potentially negative effect of correlation of demand between two periods. Further, we investigate how the duration of the first period vis‐à‐vis the second period affects the profitability of the buyer as a function of the degree of correlation. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 25–45, 2002; DOI 10.1002/nav.10002 相似文献
476.
A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
477.
We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
478.
We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
479.
The signature of a system with independent and identically distributed (i.i.d.) component lifetimes is a vector whose ith element is the probability that the ith component failure is fatal to the system. System signatures have been found to be quite useful tools in the study and comparison of engineered systems. In this article, the theory of system signatures is extended to versions of signatures applicable in dynamic reliability settings. It is shown that, when a working used system is inspected at time t and it is noted that precisely k failures have occurred, the vector s [0,1]n‐k whose jth element is the probability that the (k + j)th component failure is fatal to the system, for j = 1,2,2026;,n ‐ k, is a distribution‐free measure of the design of the residual system. Next, known representation and preservation theorems for system signatures are generalized to dynamic versions. Two additional applications of dynamic signatures are studied in detail. The well‐known “new better than used” (NBU) property of aging systems is extended to a uniform (UNBU) version, which compares systems when new and when used, conditional on the known number of failures. Sufficient conditions are given for a system to have the UNBU property. The application of dynamic signatures to the engineering practice of “burn‐in” is also treated. Specifically, we consider the comparison of new systems with working used systems burned‐in to a given ordered component failure time. In a reliability economics framework, we illustrate how one might compare a new system to one successfully burned‐in to the kth component failure, and we identify circumstances in which burn‐in is inferior (or is superior) to the fielding of a new system. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
480.
In this article, we study the design and control of manufacturing cells with a mix of manual and automated equipment, operating under a CONWIP pull protocol, and staffed by a single agile (cross‐trained) worker. For a three‐station line with one automated station, we fully characterize the structure of the optimal control policy for the worker and show that it is a static priority policy. Using analytical models and extensive simulation experiments, we also evaluate the effectiveness of practical heuristic control policies and provide managerial insights on automation configuration design of the line. This characterization of the worker control policy enables us to develop managerial insights into the design issues of how best to locate and concentrate automation in the line. Finally, we show that, in addition to ease of control and greater design flexibility, the CONWIP protocol also offers higher efficiency and robustness than does the push protocol. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献