全文获取类型
收费全文 | 658篇 |
免费 | 10篇 |
出版年
2021年 | 6篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 16篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2013年 | 124篇 |
2011年 | 6篇 |
2010年 | 6篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 11篇 |
2004年 | 12篇 |
2003年 | 7篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 13篇 |
1996年 | 15篇 |
1995年 | 10篇 |
1994年 | 15篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 20篇 |
1990年 | 13篇 |
1989年 | 14篇 |
1988年 | 9篇 |
1987年 | 17篇 |
1986年 | 13篇 |
1985年 | 16篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 9篇 |
1981年 | 11篇 |
1980年 | 13篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 11篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 11篇 |
1972年 | 10篇 |
1971年 | 13篇 |
1969年 | 9篇 |
1968年 | 6篇 |
排序方式: 共有668条查询结果,搜索用时 15 毫秒
651.
652.
653.
A definition of the problem of the initial transient with respect to the steady-state mean value has been formulated. A set of criteria has been set forth by which the efficaacy of any proposed rule may be assessed. Within this framework, five heuristic rules for predicting the approximate end of transiency, four of which have been quoted extensively in the simulation literature, have been evaluated in the M/M/1 situation. All performed poorly and are not suitable for their intended use. 相似文献
654.
In this paper we describe an approach to the scheduling and/or real-time control of sorting operations in the presence of deadlines. The problem arises in the postal service where mail has to be sorted by zip codes, and in the banking system where checks have to be sorted according to the bank on which they are drawn. In both applications losses are incurred if items miss their clearing deadlines. For example, in check-sorting an extremely important objective of the control system is to reduce the “float” i.e., the total dollar value of the checks which miss their deadlines. The proposed real-time control system utilizes a linear program which chooses between alternative sort-patterns and assigns the various processing steps to the time periods between deadlines. 相似文献
655.
Robert F. Love 《海军后勤学研究》1967,14(2):185-217
A method is presented for calculating optimal inventory levels in a two-station transactions reporting inventory system. The criterion of optimality is the minimization of expected cost. The computational properties of the model are stressed and the solution method is precise. It is shown that when the model represents a central warehouse which supplies several retail outlets, stocks carried at the central location affect the capacity of the system to handle orders. Stocks carried at the retail level affect only the size of the retail order backlog. 相似文献
656.
This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
657.
Nina A. Kollars 《战略研究杂志》2015,38(4):529-553
Wartime adaptation is a process of adjustment from the war you planned for to the one you have. This process of adjustment is done, in part, by the practitioners of war in the theater of conflict–soldier-led adaptation. Drawing upon two case studies of gun truck development in Iraq and Vietnam I argue that soldiers created networks in order to adapt to battlefield challenges and that the pattern of those networks carries implications for the likelihood of formal adoption by the organization. Simply put, the pattern of the flow of ideas, resources, and skills across the battlefield may affect the likelihood of bottom-up adaptation. 相似文献
658.
In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes nonmonetary rewards to contributors; otherwise, their donations are refunded. We study how to design such campaigns when contributors choose not just whether to contribute, but also when to contribute. We show that strategic contribution behavior—when contributors intentionally delay until campaign success is likely—can arise from the combination of nonrefundable (potentially very small) hassle costs and the risk of campaign failure, and can explain pledging patterns commonly observed in crowdfunding. Furthermore, such delays do not hurt the entrepreneur if contributors are perfectly rational, but they do if contributors are distracted, that is, if they might fail to return to the campaign after an intentional delay. To mitigate this, we find that an entrepreneur can use a simple menu of rewards with a fixed number of units sold at a low price, and an unlimited number sold at a higher price; this segments contributors over time based on the information they observe upon arrival. We show that, despite its simplicity, such a menu performs well compared to a theoretically optimal menu consisting of an infinite number of different rewards and price levels under many conditions. 相似文献
659.
潜在故障状态可测的一种故障检查模型 总被引:1,自引:0,他引:1
从系统的功能故障状态和潜在故障状态两方面讨论了故障检查模型,基于延迟时间模型推导了系统的期望可用度模型并对其适用性进行了讨论与验证。 相似文献
660.