全文获取类型
收费全文 | 2895篇 |
免费 | 493篇 |
国内免费 | 353篇 |
出版年
2024年 | 5篇 |
2023年 | 7篇 |
2022年 | 20篇 |
2021年 | 38篇 |
2020年 | 32篇 |
2019年 | 33篇 |
2018年 | 38篇 |
2017年 | 111篇 |
2016年 | 145篇 |
2015年 | 91篇 |
2014年 | 197篇 |
2013年 | 129篇 |
2012年 | 213篇 |
2011年 | 217篇 |
2010年 | 155篇 |
2009年 | 248篇 |
2008年 | 203篇 |
2007年 | 194篇 |
2006年 | 237篇 |
2005年 | 229篇 |
2004年 | 195篇 |
2003年 | 130篇 |
2002年 | 110篇 |
2001年 | 118篇 |
2000年 | 89篇 |
1999年 | 92篇 |
1998年 | 81篇 |
1997年 | 64篇 |
1996年 | 54篇 |
1995年 | 52篇 |
1994年 | 55篇 |
1993年 | 40篇 |
1992年 | 42篇 |
1991年 | 39篇 |
1990年 | 22篇 |
1989年 | 13篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有3741条查询结果,搜索用时 15 毫秒
951.
In this article we address an important class of supply contracts called the Rolling Horizon Flexibility (RHF) contracts. Under such a contract, at the beginning of the horizon a buyer has to commit requirements for components for each period into the future. Usually, a supplier provides limited flexibility to the buyer to adjust the current order and future commitments in a rolling horizon manner. We present a general model for a buyer's procurement decision under RHF contracts. We propose two heuristics and derive a lower bound. Numerically, we demonstrate the effectiveness of the heuristics for both stationary and non‐stationary demands. We show that the heuristics are easy to compute, and hence, amenable to practical implementation. We also propose two measures for the order process that allow us to (a) evaluate the effectiveness of RHF contracts in restricting the variability in the orders, and (b) measure the accuracy of advance information vis‐a‐vis the actual orders. Numerically we demonstrate that the order process variability decreases significantly as flexibility decreases without a dramatic increase in expected costs. Our numerical studies provide several other managerial insights for the buyer; for example, we provide insights into how much flexibility is sufficient, the value of additional flexibility, the effect of flexibility on customer satisfaction (as measured by fill rate), etc. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
952.
Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
953.
为了保证人为差错分类的全面性和一致性,在详细分析现有人为差错分类方法的基础上,提出了一种新的人为差错分类框架.该框架以"执行差错,忽略"为起点进行细化,得到五种基本的人为差错类别.以此作为人为差错原语,结合认知模型,分析了不同认知阶段可能出现的人为差错模式.实例证明,在这种分类方法指导下来分析人为差错,对提高人为差错分类结果的全面性和一致性有着重要意义. 相似文献
954.
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
955.
In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
956.
G. Levitin 《海军后勤学研究》2003,50(4):322-344
Weighted voting classifiers considered in this paper consist of N units each providing individual classification decisions. The entire system output is based on tallying the weighted votes for each decision and choosing the one which has total support weight exceeding a certain threshold. Each individual unit may abstain from voting. The entire system may also abstain from voting if no decision support weight exceeds the threshold. Existing methods of evaluating the reliability of weighted voting systems can be applied to limited special cases of these systems and impose some restrictions on their parameters. In this paper a universal generating function method is suggested which allows the reliability of weighted voting classifiers to be exactly evaluated without imposing constraints on unit weights. Based on this method, the classifier reliability is determined as a function of a threshold factor, and a procedure is suggested for finding the threshold which minimizes the cost of damage caused by classifier failures (misclassification and abstention may have different price.) Dynamic and static threshold voting rules are considered and compared. A method of analyzing the influence of units' availability on the entire classifier reliability is suggested, and illustrative examples are presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 322–344, 2003. 相似文献
957.
958.
959.
数字化部队指挥网络系统效能评价模型 总被引:5,自引:0,他引:5
以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。 相似文献
960.