全文获取类型
收费全文 | 1352篇 |
免费 | 30篇 |
出版年
2021年 | 18篇 |
2019年 | 39篇 |
2018年 | 22篇 |
2017年 | 35篇 |
2016年 | 30篇 |
2015年 | 32篇 |
2014年 | 25篇 |
2013年 | 266篇 |
2010年 | 15篇 |
2009年 | 17篇 |
2007年 | 17篇 |
2006年 | 17篇 |
2005年 | 22篇 |
2004年 | 25篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2000年 | 18篇 |
1999年 | 14篇 |
1998年 | 21篇 |
1997年 | 28篇 |
1996年 | 26篇 |
1995年 | 11篇 |
1994年 | 29篇 |
1993年 | 20篇 |
1992年 | 18篇 |
1991年 | 30篇 |
1990年 | 18篇 |
1989年 | 30篇 |
1988年 | 24篇 |
1987年 | 28篇 |
1986年 | 31篇 |
1985年 | 26篇 |
1984年 | 19篇 |
1983年 | 20篇 |
1982年 | 18篇 |
1981年 | 18篇 |
1980年 | 20篇 |
1979年 | 22篇 |
1978年 | 21篇 |
1977年 | 17篇 |
1976年 | 21篇 |
1975年 | 15篇 |
1974年 | 23篇 |
1973年 | 23篇 |
1972年 | 21篇 |
1971年 | 22篇 |
1970年 | 16篇 |
1969年 | 16篇 |
1968年 | 14篇 |
1967年 | 14篇 |
排序方式: 共有1382条查询结果,搜索用时 15 毫秒
111.
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. 相似文献
112.
We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal distinct due dates or optimal common due dates for a given schedule is investigated. The scheduling problem for a fixed common due date is considered when random completion times arise from machine breakdowns. The optimality of a V-shaped about (a point) T sequence is established when the number of machine breakdowns follows either a Poisson or a geometric distribution and the duration of a breakdown has an exponential distribution. © 1996 John Wiley & Sons, Inc. 相似文献
113.
Stochastic combat models are more realistic than either deterministic or exponential models. Stochastic combat models have been solved analytically only for small combat sizes. It is very difficult, if not impossible, to extend previous solution techniques to larger-scale combat. This research provides the solution for many-on-many heterogeneous stochastic combat with any break points. Furthermore, every stage in stochastic combat is clearly defined and associated aiming and killing probabilities are calculated. © 1996 John Wiley & Sons, Inc. 相似文献
114.
Silverman's game on (1, B) × (1, B) was analyzed by R. J. Evans, who showed that optimal strategies exist (and found them) only on a set of measure zero in the parameter plane. We examine the corresponding game on (1, B) × (1, D) with D > B, and show that optimal strategies exist in about half the parameter plane. Optimal strategies and game value are obtained explicitly. © 1995 John Wiley & Sons, Inc. 相似文献
115.
The facility location and capacity acquisition decisions are intertwined, especially within the international context where capacity acquisition costs are location dependent. A review of the relevant literature however, reveals that the facility location and the capacity acquisition problems have been dealt with separately. Thus, an integrated approach for simultaneous optimization of these strategic decisions is presented. Analytical properties of the arising model are investigated and an algorithm for solving the problem is devised. Encouraging computational results are reported. © 1995 John Wiley & Sons, Inc. 相似文献
116.
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. 相似文献
117.
The DOD directs the usage of 10% of item cost as the cost of capital in the calculation of inventory holding costs. This 10% cost is not totally justified and a complete review must be accomplished to bring this factor to a meaningful and more useful value. The current logic supporting a 10% cost of capital results in a continuing perturbation which forces the Air Force to operate in a less than efficient mode when using the economic order quantity for consumable purchases. 相似文献
118.
While the traditional solution to the problem of meeting stochastically variable demands for inventory during procurement lead time is through the use of some level of safety stock, several authors have suggested that a decision be made to employ some form of rationing so as to protect certain classes of demands against stockout by restricting issues to other classes. Nahmias and Demmy [10] derived an approximate continuous review model of systems with two demand classes which would permit an inventory manager to calculate the expected fill rates per order cycle for high-priority, low-priority, and total system demands for a variety of parameters. The manager would then choose the rationing policy that most closely approximated his fill-rate objectives. This article describes a periodic review model that permits the manager to establish a discrete time rationing policy during lead time by prescribing a desired service level for high-priority demands. The reserve levels necessary to meet this level of service can then be calculated based upon the assumed probability distributions of high- and low-priority demands over lead time. The derived reserve levels vary with the amount of lead time remaining. Simulation tests of the model indicate they are more effective than the single reserve level policy studied by Nahmias and Demmy. 相似文献
119.
A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models. 相似文献
120.
Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria
M. Murat Kksalan 《海军后勤学研究》1989,36(4):359-372
In this article an interactive method is developed to identify and rank a most preferred subset, T, of alternatives assuming that the decision maker has an implicit quasiconcave nondecreasing utility function. The method requires the decision maker to compare pairs of selected alternatives. Based on the responses of the decision maker, convex cones are constructed to eliminate alternatives that are proved to be inferior to alternatives in set T. The method aims at keeping the number of pairwise comparisons small. Computational experience with the method indicates that the required number of pairwise comparisons to form set T is usually small. However, the number of pairwise comparisons needed to confirm that this set is best may be large. 相似文献