全文获取类型
| 收费全文 | 376篇 |
| 免费 | 0篇 |
专业分类
| 376篇 |
出版年
| 2021年 | 7篇 |
| 2019年 | 7篇 |
| 2018年 | 4篇 |
| 2017年 | 3篇 |
| 2016年 | 7篇 |
| 2015年 | 2篇 |
| 2014年 | 5篇 |
| 2013年 | 55篇 |
| 2012年 | 3篇 |
| 2009年 | 4篇 |
| 2007年 | 13篇 |
| 2005年 | 2篇 |
| 2004年 | 3篇 |
| 2003年 | 7篇 |
| 2002年 | 6篇 |
| 2001年 | 2篇 |
| 2000年 | 3篇 |
| 1999年 | 3篇 |
| 1998年 | 7篇 |
| 1997年 | 8篇 |
| 1996年 | 9篇 |
| 1995年 | 3篇 |
| 1994年 | 6篇 |
| 1993年 | 10篇 |
| 1992年 | 7篇 |
| 1991年 | 9篇 |
| 1990年 | 10篇 |
| 1989年 | 17篇 |
| 1988年 | 14篇 |
| 1987年 | 7篇 |
| 1986年 | 13篇 |
| 1985年 | 7篇 |
| 1984年 | 4篇 |
| 1983年 | 3篇 |
| 1982年 | 10篇 |
| 1981年 | 6篇 |
| 1980年 | 7篇 |
| 1979年 | 9篇 |
| 1978年 | 8篇 |
| 1977年 | 5篇 |
| 1976年 | 5篇 |
| 1975年 | 4篇 |
| 1974年 | 8篇 |
| 1973年 | 5篇 |
| 1972年 | 3篇 |
| 1971年 | 7篇 |
| 1970年 | 6篇 |
| 1969年 | 5篇 |
| 1967年 | 6篇 |
| 1948年 | 4篇 |
排序方式： 共有376条查询结果，搜索用时 15 毫秒
301.
The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces. 相似文献
302.
Unit‐load warehouses store and retrieve unit‐loads, typically pallets. When storage and retrieval operations are not coordinated, travel is from a pickup and deposit (P&D) point to a pallet location and back again. In some facilities, workers interleave storage and retrieval operations to form a dual‐command cycle. Two new aisle designs proposed by Gue and Meller (“Improving the unit‐load warehouse.” In Progress in Material Handling Research: 2006. Material Handling Industry of America, Charlotte, NC, 2006) use diagonal aisles to reduce the travel distance to a single pallet location by approximately 10 and 20[percnt] for the two designs, respectively. We develop analytical expressions for travel between pallet locations for one of these—the fishbone design. We then compare fishbone warehouses that have been optimized for dual‐command to traditional warehouses that have been optimized in the same manner, and show that an optimal fishbone design reduces dual‐command travel by 10–15%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 54: 389–403, 2009 相似文献
303.
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 相似文献
304.
Mustapha Bouhtou Alexander Grigoriev Stan van Hoesel Anton F. van der Kraaij Frits C.R. Spieksma Marc Uetz 《海军后勤学研究》2007,54(4):411-420
We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
305.
Reliability Economics is a field that can be defined as the collection of all problems in which there is tension between the performance of systems of interest and their cost. Given such a problem, the aim is to resolve the tension through an optimization process that identifies the system which maximizes some appropriate criterion function (e.g. expected lifetime per unit cost). In this paper, we focus on coherent systems of n independent and identically distributed (iid) components and mixtures thereof, and characterize both a system's performance and cost as functions of the system's signature vector (Samaniego, IEEE Trans Reliabil (1985) 69–72). For a given family of criterion functions, a variety of optimality results are obtained for systems of arbitrary order n. Approximations are developed and justified when the underlying component distribution is unknown. Assuming the availability of an auxiliary sample of N component failure times, the asymptotic theory of L‐estimators is adapted for the purpose of establishing the consistency and asymptotic normality of the proposed estimators of the expected ordered failure times of the n components of the systems under study. These results lead to the identification of ε‐optimal systems relative to the chosen criterion function. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
306.
We consider a manufacturer (i.e., a capacitated supplier) that produces to stock and has two classes of customers. The primary customer places orders at regular intervals of time for a random quantity, while the secondary customers request a single item at random times. At a predetermined time the manufacturer receives advance demand information regarding the order size of the primary customer. If the manufacturer is not able to fill the primary customer's demand, there is a penalty. On the other hand, serving the secondary customers results in additional profit; however, the manufacturer can refuse to serve the secondary customers in order to reserve inventory for the primary customer. We characterize the manufacturer's optimal production and stock reservation policies that maximize the manufacturer's discounted profit and the average profit per unit time. We show that these policies are threshold‐type policies, and these thresholds are monotone with respect to the primary customer's order size. Using a numerical study we provide insights into how the value of information is affected by the relative demand size of the primary and secondary customers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
307.
308.
Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information. 相似文献
309.
James R. Jackson 《海军后勤学研究》1967,14(1):23-41
Certain zero-sum games are examined in which an individual player is opposed by a two-man team. The members of the team have identical interests, but must act separately during play. Most of the paper is devoted to instances in which one teammate has an opportunity to communicate to the other about their mutual opponent's strategy; but he may only be able to transmit a limited amount of information and his choice of a “message” may affect the payoff. The team must thus make economically efficient use of a limited communication opportunity. The present paper treats a variety of models, all of which are formulated as rectangular (matrix) games. Related models, some of which cannot be so formulated either because of restrictions on the team's opportunities to use mixed strategies or because they are non-zero-sum games, will be treated in another paper. 相似文献
310.