全文获取类型
收费全文 | 167篇 |
免费 | 32篇 |
国内免费 | 7篇 |
出版年
2024年 | 1篇 |
2022年 | 3篇 |
2021年 | 5篇 |
2020年 | 11篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 2篇 |
2015年 | 10篇 |
2014年 | 12篇 |
2013年 | 25篇 |
2012年 | 15篇 |
2011年 | 9篇 |
2010年 | 14篇 |
2009年 | 14篇 |
2008年 | 7篇 |
2007年 | 12篇 |
2006年 | 1篇 |
2005年 | 2篇 |
2004年 | 11篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2001年 | 10篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有206条查询结果,搜索用时 78 毫秒
51.
针对新技术发展及军事装备保障需求变化对装备维修保障的影响,以装备全系统、全寿命的观点,探讨了装备维修发展的新特点,构建了面向装备全寿命周期的新型维修技术体系,并综述了基于信息的先进维修技术发展方向,为装备维修保障研究提供了参考。 相似文献
52.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
53.
随着武警部队编制体制的不断调整,士官教员逐步成为院校人才教育的重要组成部分。武警院校应发挥士官教育的优势,不断健全士官教员的培养机制、科学合理的管理模式,使士官教员成为新型军事人才培养的有力推手和有益补充,进一步科学提升武警院校学员满足第一任职的需求及院校教育的发展。 相似文献
54.
55.
Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999 相似文献
56.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
57.
Adam Janiak 《海军后勤学研究》1998,45(1):99-113
The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998 相似文献
58.
59.
本文介绍了八十年代末出现的超音速等离子喷涂系统,分析了稳定集聚的高热焓、超高速的超音速等离子焰流的形成机理及其对喷涂颗粒的作用,比较了超音速等离子喷涂与常规的大气等离子喷涂的陶瓷涂层的质量,指出超音速等离子喷涂是一项用于获得高质量的陶瓷涂层的新技术. 相似文献
60.