全文获取类型
收费全文 | 136篇 |
免费 | 54篇 |
国内免费 | 3篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 8篇 |
2019年 | 1篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 8篇 |
2012年 | 5篇 |
2011年 | 9篇 |
2010年 | 5篇 |
2009年 | 12篇 |
2008年 | 5篇 |
2007年 | 7篇 |
2006年 | 13篇 |
2005年 | 18篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 3篇 |
1998年 | 9篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
排序方式: 共有193条查询结果,搜索用时 218 毫秒
71.
72.
73.
We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n2) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n2) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013 相似文献
74.
分析目前步兵武器零件表层喷涂技术现状,提出全气动自动喷涂机设计方案,根据步兵武器零件结构特点,规划自动喷涂轨迹,设计全气动自动化喷涂专用设备.该设备具有本质安全性,适于部队条件下使用. 相似文献
75.
基于CPLD与单片机的多路高精度数据采集系统设计 总被引:4,自引:0,他引:4
结合CPLD与单片机设计了一种多路高精度数据采集系统,最高可达24位转换精度。所采集数据具备良好的实时性,可采集通道数目多,同时系统具备较强的抗外界干扰能力,结构简单,可靠性好。该系统具有较强的可移植性,能够广泛应用于多路、高精度、低频数据采集的场合。 相似文献
76.
In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
77.
We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015 相似文献
78.
It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015 相似文献
79.
80.
为解决液体火箭发动机故障诊断正负样本不平均问题,以及实现发动机稳态工作段自适应故障检测,建立了基于快速增量单分类支持向量机的异常检测模型。采取特征工程方法,对传感器获得的多变量时间序列进行特征提取。通过增量学习方法,对单分类支持向量机模型进行改进,并应用于液体火箭发动机异常检测,使单分类支持向量机检测模型具备对不同台次、不同工况的自适应性,提高了模型的计算速度。对多台次热试车数据的分析结果表明,该模型十分有效,训练速度快,具备实用价值。 相似文献