全文获取类型
收费全文 | 983篇 |
免费 | 223篇 |
国内免费 | 43篇 |
专业分类
1249篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 14篇 |
2021年 | 13篇 |
2020年 | 32篇 |
2019年 | 21篇 |
2018年 | 21篇 |
2017年 | 60篇 |
2016年 | 50篇 |
2015年 | 42篇 |
2014年 | 78篇 |
2013年 | 67篇 |
2012年 | 71篇 |
2011年 | 78篇 |
2010年 | 64篇 |
2009年 | 71篇 |
2008年 | 69篇 |
2007年 | 75篇 |
2006年 | 66篇 |
2005年 | 71篇 |
2004年 | 49篇 |
2003年 | 44篇 |
2002年 | 34篇 |
2001年 | 36篇 |
2000年 | 25篇 |
1999年 | 21篇 |
1998年 | 14篇 |
1997年 | 15篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 3篇 |
排序方式: 共有1249条查询结果,搜索用时 0 毫秒
111.
项目管理能力是评价科研单位是否具有牵头组织能力的重要指标之一。针对现有评价方法在稳定性、科学性方面的不足,以传统的科研项目管理能力评估方法为基础,引入贝叶斯理论,建立了贝叶斯决策评估模型,并利用实际案例验证了其在科研项目管理能力评估中的有效性。结果表明,该评估方法能够充分利用历史资料和专家意见,对初步评估结果进行再度评估,具有较强的客观性、准确性。 相似文献
112.
胡光蓉 《兵团教育学院学报》2008,18(3):54-55
预算管理是高校财务管理的核心,加强高校预算管理,能促进高校事业计划顺利完成,有效提高各项资金的使用效益。本文通过对高校预算管理的内容、特点及不足的分析,提出了加强高校预算管理的对策。 相似文献
113.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
114.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
115.
We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
116.
刘永基 《中国人民武装警察部队学院学报》2000,16(1):31-32,39
本文针对消防教学和消防管理工作的实际,探讨了消防监督管理咨询专家系统的开发和应用课题,并展望了如何运用多媒体和因特网工具提高消防管理现代化水平的前景。 相似文献
117.
论装备保障信息资源管理 总被引:7,自引:1,他引:7
根据信息资源管理的基本理论给出了装备保障信息资源管理的定义和基本要求 ,针对我军装备保障信息资源管理中存在的问题 ,提出了初步的改进设想 相似文献
118.
This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000 相似文献
119.
废气涡轮增压柴油机动态模型研究 总被引:3,自引:0,他引:3
研究了废气涡轮增压柴油机作为转速控制对象时的动态数学模型 ,并在此基础上建立了数字式电子调速器仿真系统 . 相似文献
120.
In this paper, we extend the inventory lot‐size models to allow for inflation and fluctuating demand (which is more general than constant, increasing, decreasing, and log‐concave demand patterns). We prove that the optimal replenishment schedule not only exists but is also unique. Furthermore, we show that the total cost associated with the inventory system is a convex function of the number of replenishments. Hence, the search for the optimal number of replenishments is simplified to finding a local minimum. Finally, several numerical examples are provided to illustrate the results. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 144–158, 2001 相似文献