全文获取类型
收费全文 | 964篇 |
免费 | 246篇 |
国内免费 | 53篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 16篇 |
2021年 | 15篇 |
2020年 | 30篇 |
2019年 | 24篇 |
2018年 | 21篇 |
2017年 | 66篇 |
2016年 | 59篇 |
2015年 | 46篇 |
2014年 | 81篇 |
2013年 | 68篇 |
2012年 | 78篇 |
2011年 | 78篇 |
2010年 | 64篇 |
2009年 | 76篇 |
2008年 | 68篇 |
2007年 | 68篇 |
2006年 | 69篇 |
2005年 | 66篇 |
2004年 | 46篇 |
2003年 | 44篇 |
2002年 | 30篇 |
2001年 | 34篇 |
2000年 | 22篇 |
1999年 | 20篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 3篇 |
排序方式: 共有1263条查询结果,搜索用时 15 毫秒
661.
Snke Hartmann 《海军后勤学研究》1998,45(7):733-750
In this paper we consider the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective. We propose a new genetic algorithm approach to solve this problem. Subsequently, we compare it to two genetic algorithm concepts from the literature. While our approach makes use of a permutation based genetic encoding that contains problem-specific knowledge, the other two procedures employ a priority value based and a priority rule based representation, respectively. Then we present the results of our thorough computational study for which standard sets of project instances have been used. The outcome reveals that our procedure is the most promising genetic algorithm to solve the RCPSP. Finally, we show that our genetic algorithm yields better results than several heuristic procedures presented in the literature. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 733–750, 1998 相似文献
662.
We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and known variances that are proportional to the means. The due dates of the jobs are random variables following a common probability distribution. The objective is to minimize the expectation of a weighted combination of the earliness penalty, the tardiness penalty, and the flow-time penalty. One of our main results is that an optimal sequence for the problem must be V-shaped with respect to the mean processing times. Other characterizations of the optimal solution are also established. Two algorithms are proposed, which can generate optimal or near-optimal solutions in pseudopolynomial time. The proposed algorithms are also extended to problems where processing times do not satisfy the assumption in the model above, and are evaluated when processing times follow different probability distributions, including general normal (without the proportional relation between variances and means), uniform, Laplace, and exponential. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 531–557, 1997. 相似文献
663.
环境信息动态更新是分布式虚拟环境的一个主要特点,如何使环境信息更新更活跃、更反应实际情况,一直是分布式虚拟环境研究的重点。在典型的分布式交互环境中,环境信息动态更新是基于协议数据单元(PDU),它不提供数据可靠性传输保证。如何保证分布式环境中各结点环境信息一致性,本文提出了一种信息校验和协议,它通过极少的信息传输就可保证各结点环境信息高度一致。文中定义了保证分布式环境信息动态一致性更新的协议数据单元,并在试验环境中证明了协议的可靠性。 相似文献
664.
An important phenomenon often observed in supply chain management, known as the bullwhip effect, implies that demand variability increases as one moves up the supply chain, i.e., as one moves away from customer demand. In this paper we quantify this effect for simple, two‐stage, supply chains consisting of a single retailer and a single manufacturer. We demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the use of a moving average forecast. We consider two types of demand processes, a correlated demand process and a demand process with a linear trend. We then discuss several important managerial insights that can be drawn from this research. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 269–286, 2000 相似文献
665.
张先剑 《国防科技大学学报》2019,41(2):185-190
大规模作战具有高动态、非完全信息和不确定性,在分析归纳目前解决动态武器目标分配问题的一系列方法的基础上,尝试构建基于双方动态博弈的攻防对抗综合数学模型,并利用纳什均衡和帕累托最优算法进行分阶段求解。结果表明,该数学模型和博弈论方法结合能够有效解决武器目标动态分配问题。 相似文献
666.
针对目前效能评估方法多重视效能指标的静态观测值,对时序状态数据所蕴含的趋势信息关注较少的缺点,提出基于灰色聚类-粗糙集和集对分析的备件保障效能动态评估方法。针对主客观赋权方法各自的优缺点,引入依赖度和重要度的概念,建立灰色聚类-粗糙集组合赋权模型;将指标权重引入集对理论,提出集对同势、均势和反势的定义,描述备件保障效能的变化规律,构建基于马尔可夫链的集对分析动态模型。实例分析结果表明,该方法可以有效反映备件保障效能的动态变化特征,为决策者制定备件保障长期计划提供科学依据。 相似文献
667.
This paper considers the rescheduling of surface‐to‐air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti‐ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no‐leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP‐hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented ? ‐ constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated. 相似文献
668.
Supply chains are often characterized by the presence of a dominant buyer purchasing from a supplier with limited capacity. We study such a situation where a single supplier sells capacity to an established and more powerful buyer and also to a relatively less powerful buyer. The more powerful buyer enjoys the first right to book her capacity requirements at supplier's end, and then the common supplier fulfills the requirement of the less powerful buyer. We find that when the supplier's capacity is either too low (below the lower threshold) or too high (above the higher threshold), there is no excess procurement as compared to the case when supplier has infinite capacity. When the supplier's capacity is between these two thresholds, the more powerful buyer purchases an excess amount in comparison to the infinite capacity case. 相似文献
669.
We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions. 相似文献
670.
以行星巡视探测任务为背景,针对资源紧张条件下自主控制载荷进行科学探测的需求,提出一种集中式载荷控制方法。建立新型的载荷电子学和载荷数管集成一体化硬件架构;软件采用基于事件表和工作模式表的控制方式自主控制载荷工作;采取多项健康管理措施,依据预设的规则监控载荷的状态,自主对故障载荷采取恢复和隔离措施。实现的公用控制部分仅重3 kg,功耗6 W,软件支持9个工作模式表同时运行,指令执行时刻误差优于40 ms。该方法应用到我国首次火星探测任务中,地面测试结果表明其简捷、高效、可靠,适合在资源苛刻的行星巡视探测任务中,对各载荷进行控制。 相似文献