全文获取类型
收费全文 | 217篇 |
免费 | 46篇 |
国内免费 | 14篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 8篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 4篇 |
2015年 | 7篇 |
2014年 | 18篇 |
2013年 | 19篇 |
2012年 | 11篇 |
2011年 | 10篇 |
2010年 | 13篇 |
2009年 | 18篇 |
2008年 | 15篇 |
2007年 | 21篇 |
2006年 | 11篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 7篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1982年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有277条查询结果,搜索用时 15 毫秒
81.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
82.
目标选择是军事计划的关键要素之一。基于马尔科夫决策方法,解决具有复杂目标间关联的多阶段目标选择问题。使用与或树描述目标体系各层状态间的影响关联,并以目标体系整体失效为求解目的,建立了基于离散时间MDP的多阶段打击目标选择模型。在LRTDP算法基础上提出一种启发式方法,通过判断从当前目标体系状态到达体系失效状态的演化过程中的可能资源消耗和失败概率,来提供对当前状态的评估值,该方法能有效排除问题搜索空间中不能到达体系失效目的的中间状态,压缩了由于目标间复杂关联而增长的巨大状态空间。用实验验证了该方法有效性,实验结果表明,该方法直观实用,对目标间具有复杂关联关系的目标打击决策有一定参考价值。 相似文献
83.
84.
85.
86.
针对某型航空发动机燃-滑油附件后盖同部位成批次出现裂纹的问题,提出了裂纹故障引导转移的避障策略。通过研究裂纹产生的主要原因,分析后盖不同部位所产生的裂纹可能对航空发动机造成的危害程度,调整改变原支撑结构,在后盖非关键部位形成新的应力集中点,降低关键部位应力集中区的应力幅值,迫使故障从不可修复的关键部位转移到可修复的非关键部位。经计算机仿真,确定了裂纹引导缺口的最佳参数;同时,仿真结果表明,裂纹故障引导转移策略合理可行。 相似文献
87.
88.
进攻是最好的防守。针对水面舰艇攻势防御问题,对水面舰艇攻势防御的概念及使用前提进行了讨论,通过与守势防御的比较,从理论上对攻势防御的优势进行了论证。最后,根据论证结果、数据仿真及作战实际,给出了攻势防御的使用原则。 相似文献
89.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
90.
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 相似文献