全文获取类型
收费全文 | 240篇 |
免费 | 111篇 |
国内免费 | 28篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 6篇 |
2020年 | 13篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 14篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 21篇 |
2013年 | 22篇 |
2012年 | 27篇 |
2011年 | 16篇 |
2010年 | 12篇 |
2009年 | 18篇 |
2008年 | 17篇 |
2007年 | 20篇 |
2006年 | 19篇 |
2005年 | 17篇 |
2004年 | 21篇 |
2003年 | 15篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 8篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 4篇 |
排序方式: 共有379条查询结果,搜索用时 15 毫秒
301.
302.
针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性. 相似文献
303.
This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016 相似文献
304.
This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017 相似文献
305.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
306.
307.
James Flynn 《海军后勤学研究》2001,48(5):430-449
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001 相似文献
308.
利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用 相似文献
309.
针对现代非接触战争的特点,用数学方法研究导弹对抗模型问题,针对作战的不同目的和要求,建立两个导弹对抗的非线性规划数学模型,对模型求解设计了近似方法,该方法把上述非线性规划模型化为多个线性规划模型进行求解.对一类较简单的特殊情况进行了仔细分析,得到了分析解.最后指出该方法如何应用于动态实时优化决策.本文的方法可用来预测和评估导弹对抗的效果,为作战实时优化决策提供参考. 相似文献
310.
作为全球唯一的超级大国,美国在空间观测方面具有勿庸置疑的优势。介绍了美国现有成像侦察卫星的构成、作用和发展现状,指出了美军开始注重利用商业遥感图像的新趋势,并且详细介绍了当前美国成像卫星软件的商业开发以及美国未来天基雷达计划的发展。 相似文献