全文获取类型
收费全文 | 127篇 |
免费 | 3篇 |
出版年
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 50篇 |
2012年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2005年 | 2篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有130条查询结果,搜索用时 15 毫秒
21.
A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options. 相似文献
22.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc. 相似文献
23.
Nicholas G. Hall 《海军后勤学研究》1989,36(4):399-418
We study the problem of finding the minimum number of identical storage areas required to hold n items for which demand is known and constant. The replenishments of the items within a single storage area may be time phased so as to minimize the maximum total storage capacity required at any time. This is the inventory-packing problem, which can be considered as a variant of the well-known bin-packing problem, where one constraint is nonlinear. We study the worst-case performance of six heuristics used for that earlier problem since the recognition version of the inventory-packing problem is shown to be NP complete. In addition, we describe several new heuristics developed specifically for the inventory-packing problem, and also study their worst-case performance. Any heuristic which only opens a bin when an item will not fit in any (respectively, the last) open bin needs, asymptotically, no more than 25/12 (resp., 9/4) times the optimal number of bins. Improved performance bounds are obtainable if the range from which item sizes are taken is known to be restricted. Extensive computational testing indicates that the solutions delivered by these heuristics are, for most problems, very close to optimal in value. 相似文献
24.
Dmitrii Usanov G.A. Guido Legemaate Peter M. van de Ven Rob D. van der Mei 《海军后勤学研究》2019,66(2):105-122
The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance. 相似文献
25.
26.
Peter J. Phillips 《Defense & Security Analysis》2010,26(3):261-272
The purpose of this article is to explore the economic theoretical foundations of the idea that rational terrorist organizations deliberately randomize their attacks (by type, timing, location, and targets) to generate uncertainty and intimidation. A choice theoretic framework is applied to the analysis of the terrorist organization's behavior to determine whether welfare (utility) gains from the randomization of terrorist attacks are plausible and feasible. The randomization of attacks can appear to promise higher amounts of political influence for each resource input but it turns out that randomization cannot manufacture a situation where higher amounts of political influence are obtained for each resource input.The results imply that, rather than randomization and instability, the rational terrorist organization is more likely to prefer stability. The findings and implications provide a theoretical explanation for the non-randomness of terrorist attacks.Thismay be one small step towards explaining the patterns – non-randomness – in the time-series of terrorist incidents. 相似文献
27.
Nicholas G. Hall 《海军后勤学研究》1988,35(3):319-325
This article concerns a multi-item, infinite-horizon, lot-sizing problem, where the objective is to minimize a total cost function made up of reordering cost, holding cost, and a cost determined by peak inventory levels. By spreading inventory replenishments over the reordering cycle, the peak inventory level can be reduced. The model permits the derivation of simultaneously optimal solutions for the length of the cycle and the individual item replenishment times within the cycle. An alternative formulation, in which total storage capacity is modeled as a constraint, is also solved. 相似文献
28.
This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters. 相似文献
29.
Peter Nailor 《Defense & Security Analysis》1986,2(4):333-334
Strategy in the Missile Age. By Bernard Brodie. RAND Corporation, Princeton University Press, Princeton, NJ, 1959. Paperback editions 1965, 1967. 相似文献
30.
A stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age. The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail. 相似文献