全文获取类型
收费全文 | 247篇 |
免费 | 100篇 |
国内免费 | 17篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 11篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 23篇 |
2015年 | 18篇 |
2014年 | 19篇 |
2013年 | 21篇 |
2012年 | 32篇 |
2011年 | 33篇 |
2010年 | 12篇 |
2009年 | 20篇 |
2008年 | 10篇 |
2007年 | 14篇 |
2006年 | 24篇 |
2005年 | 19篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 12篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1991年 | 1篇 |
排序方式: 共有364条查询结果,搜索用时 15 毫秒
91.
92.
从系统任务需求出发,提出了使用性能特性和保障特性的概念,并分析了二者之间的相互关系,同时给出了保障性目标的组成、内容和要求。介绍了确定保障性目标所用的方法,包括使用研究,剖面制定,比较分析,目标评估与改进以及目标实现。最后,给出了保障性目标要求确定的案例。 相似文献
93.
94.
Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
95.
针对新一代敏捷卫星对地观测任务规划问题,考虑了直拍直传、立体成像、多条带拼接等复杂任务需求和观测、数据下传、对日定向等九种卫星动作,在任务规划的同时进行卫星动作规划。设计并实现了前瞻启发式构造算法,算法满足卫星存储、能量等复杂约束,在前瞻过程中每次决定当前任务是否安排。采用基于专家知识的多种启发式规则决定任务安排与安排卫星动作序列。仿真实例及实际工程应用表明,算法可以在很短的时间内给出较好的结果,证明了本文方法对于敏捷卫星任务规划问题的适用性。 相似文献
96.
通过对维修调度问题进行分析,考虑到战斗力相关的多种目标因素,针对目前研究的目标单一,又未考虑武器的先进程度、配置等缺陷,就修复后的加权作战时间和装备尽可能少的延误数量双重目标加以研究,并给出了调度算法。从而弥补了这些缺陷,使调度更加合理。最后,算例表明模型的求解方法简单,计算时间较短,可有效地实现维修任务调度。 相似文献
97.
This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
98.
99.
任务规划系统研究综述 总被引:4,自引:0,他引:4
任务规划系统作为举世瞩目的高科技技术,已经引起了广泛的关注和应用.目前世界上一些主要国家都在研制任务规划系统,且进展很快.为了更好地推进我国学者对于任务规划系统的研究,对任务规划系统的研究进行了全面综述.主要内容包括任务规划系统的发展、应用、主要实现方法及未来发展方向.在应用中,综述了任务规划系统在战场态势评估、无人飞行器、机器人领域的应用.在主要实现方法中,主要描述了数学规划、D*优化算法、Agent方法和遗传算法四种方法.最后给出了任务规划系统未来发展方向:现代技术的融合、发展战略级任务规划系统及未来社会任务规划系统预研. 相似文献
100.
Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under differing project conditions can lead to a suboptimal choice of an appropriate heuristic for scheduling any given project. This may result in poor schedules and monetary losses. This paper reports on the application of the tabu search metaheuristic procedure for the RCPSPCF. Strategies for neighborhood generation and candidate selection that exploit the special features of the problem are combined with a simple multiheuristic start procedure. Extensive experimentation, with multiple data sets and comparison with an upper bound, indicates a significant improvement, both in project Net Present Value (NPV) as well as the number of projects, where the metaheuristic outperforms the best known heuristics in the literature. More specifically, this procedure produces the best schedules in over 85% of the projects tested, in contrast to the best single-pass heuristics which have been shown to dominate in at most 20% of the same cases. This iterative, general purpose heuristic is able to adapt significantly better to the complex interactions of the many critical parameters of the RCPSPCF than single-pass heuristics that use more specific information about each project environment. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 912–927, 1999 相似文献