全文获取类型
收费全文 | 373篇 |
免费 | 80篇 |
国内免费 | 14篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 24篇 |
2014年 | 17篇 |
2013年 | 70篇 |
2012年 | 19篇 |
2011年 | 24篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 17篇 |
2005年 | 20篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有467条查询结果,搜索用时 375 毫秒
121.
122.
In this paper, we present an O(nm log(U/n)) time maximum flow algorithm. If U = O(n) then this algorithm runs in O(nm) time for all values of m and n. This gives the best available running time to solve maximum flow problems satisfying U = O(n). Furthermore, for unit capacity networks the algorithm runs in O(n2/3m) time. It is a two‐phase capacity scaling algorithm that is easy to implement and does not use complex data structures. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 511–520, 2000 相似文献
123.
文中介绍了IRM-PC机上多功能仿真软件GASP/PC的开发,叙述了GASP/PC仿真语言的形成以及对于连续、离散和复合仿真模型的GASP/PC语言的结构与仿真方法。 相似文献
124.
125.
126.
127.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
128.
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 相似文献
129.
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 相似文献
130.
我国思想政治工作者在实践中总结出来的"晓之以理、动之以情、持之以恒、导之以行"的十六字方针,是对思想政治工作规律的反映,其中的"理"、"情"、"意"、"行"是做好思想政治工作的四个基本因素,它们在思想政治工作中起着各自不可替代的作用. 相似文献