全文获取类型
收费全文 | 575篇 |
免费 | 8篇 |
出版年
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 9篇 |
2018年 | 9篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 10篇 |
2014年 | 12篇 |
2013年 | 102篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 15篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 17篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1989年 | 14篇 |
1988年 | 5篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 4篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有583条查询结果,搜索用时 15 毫秒
31.
32.
James L. Cook 《Journal of Military Ethics》2016,15(4):321-324
33.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
34.
35.
36.
We present a new approach for inference from accelerated life tests. Our approach is based on a dynamic general linear model setup which arises naturally from the accelerated life-testing problem and uses linear Bayesian methods for inference. The advantage of the procedure is that it does not require large numbers of items to be tested and that it can deal with both censored and uncensored data. We illustrate the use of our approach with some actual accelerated life-test data. © 1992 John Wiley & Sons, Inc. 相似文献
37.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
38.
Victoria L. Zhang 《海军后勤学研究》1996,43(5):691-708
This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc. 相似文献
39.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
40.
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. 相似文献