全文获取类型
收费全文 | 238篇 |
免费 | 92篇 |
国内免费 | 7篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 10篇 |
2019年 | 3篇 |
2017年 | 15篇 |
2016年 | 16篇 |
2015年 | 13篇 |
2014年 | 15篇 |
2013年 | 13篇 |
2012年 | 9篇 |
2011年 | 15篇 |
2010年 | 11篇 |
2009年 | 23篇 |
2008年 | 9篇 |
2007年 | 22篇 |
2006年 | 16篇 |
2005年 | 28篇 |
2004年 | 15篇 |
2003年 | 11篇 |
2002年 | 13篇 |
2001年 | 13篇 |
2000年 | 11篇 |
1999年 | 5篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有337条查询结果,搜索用时 15 毫秒
91.
Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations 下载免费PDF全文
We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014 相似文献
92.
超精密单点金刚石飞刀切削技术是一种比较新颖的微槽类结构加工方式。在飞切过程中,切削力是切削过程中重要的物理量,对加工后的表面质量、刀具磨损等有着直接影响。提出了一种基于直角微切削理论的动态微槽类结构飞切的力学模型,基于微切削理论,得到了前、后刀面切削力的理论模型。根据飞切的几何运动特征,建立了飞切过程中剪切角的计算模型,并根据单圈飞切实验得到了飞切过程中剪切面的变化规律。为了验证模型的正确性,采用不同切削参数进行了多圈重叠飞切实验,对切削力进行了测量和分析。实验得到的切削力大小和变化规律与理论模型计算得到的基本一致,证明了该切削力模型的有效性。 相似文献
93.
测试序列优化设计是故障诊断中的重要组成部分,最优测试序列能提高故障诊断的效率,常见的故障诊断系统均基于二值属性,而多值属性系统的测试优化问题研究的较少。针对多值属性系统测试序列优化问题的特点,提出了一种改进蚁群算法,结合二值属性系统和多值属性系统的关系,设计了适应于多值属性优化的状态转移规则和信息素更新机制。针对在等测试费用和故障先验概率的情况下不能寻优的问题,制定了对应的优化标准,符合实际的测试需求。通过对比试验,证明了其能解决电子系统多值属性系统的序列优化问题,扩展了多值属性电子系统的测试优化策略。 相似文献
94.
针对孤立脉冲群电磁超声系统信号特征容易被噪声淹没的问题,提出基于改进的非负矩阵分解(INMF)优选特征的支持向量机(SVM)方法.首先,用3种不同的方法提取高维特征;其次,用NMF方法实现特征降维,并保证降维结果的唯一性,避免对特征的直接选择;最后,应用支持向量机方法对降维特征进行分类.对孤立脉冲群电磁超声系统采集的4种信号特征进行提取、选择和分类,实验结果表明:INMF方法能有效提取微弱信号的特征,减少运算量,提高电磁超声系统特征采集的准确率. 相似文献
95.
Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
96.
王翔 《国防科技大学学报》2013,35(1)
针对欠定混合盲辨识问题,提出了一种基于时频单源点检测及聚类验证的盲辨识算法。检测各个源信号的时频单源点,利用奇异值分解的方法求解不同单源点集合对应的混合矢量,利用基于k均值的聚类验证技术完成源信号数目和混合矩阵的联合估计。算法放宽了已有方法对时频单源区域的假设,不需要假设信号存在时频单源区域,可以完成仅存在离散的时频单源点条件下的欠定混合盲辨识;同时克服了传统算法需要假设源信号个数已知的不足,可以有效地估计源信号数目。仿真结果验证了算法的有效性。 相似文献
97.
98.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
99.
In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
100.
基于遗传算法与支持向量机的火炮内膛疵病分类方法研究 总被引:1,自引:0,他引:1
支持向量机能够较好解决小样本、非线性数据特征的多分类问题,适用于火炮内膛疵病的分类,但其性能依赖于其参数的选取;对基本遗传算法进行改进,使用自适应的交叉算子和变异算子,并应用于支持向量机参数优化;通过对火炮内膛疵病分类精度的对比研究,改进的遗传算法确定支持向量机优化参数的方法取得了良好的效果,验证了该方法对疵病分类的有效性。 相似文献