全文获取类型
收费全文 | 267篇 |
免费 | 117篇 |
国内免费 | 19篇 |
出版年
2023年 | 5篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 9篇 |
2019年 | 8篇 |
2018年 | 1篇 |
2017年 | 14篇 |
2016年 | 18篇 |
2015年 | 19篇 |
2014年 | 20篇 |
2013年 | 20篇 |
2012年 | 18篇 |
2011年 | 14篇 |
2010年 | 17篇 |
2009年 | 27篇 |
2008年 | 18篇 |
2007年 | 24篇 |
2006年 | 29篇 |
2005年 | 15篇 |
2004年 | 19篇 |
2003年 | 11篇 |
2002年 | 9篇 |
2001年 | 13篇 |
2000年 | 9篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有403条查询结果,搜索用时 15 毫秒
311.
We consider a make‐to‐order production system where two major components, one nonperishable (referred to as part 1) and one perishable (part 2), are needed to fulfill a customer order. In each period, replenishment decisions for both parts need to be made jointly before demand is realized and a fixed ordering cost is incurred for the nonperishable part. We show that a simple (sn,S,S) policy is optimal. Under this policy, S along with the number of backorders at the beginning of a period if any and the availability of the nonperishable part (part 1) determines the optimal order quantity of the perishable part (part 2), while (sn,S) guide when and how much of part 1 to order at each state. Numerical study demonstrates that the benefits of using the joint replenishment policy can be substantial, especially when the unit costs are high and/or the profit margin is low. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
312.
313.
天基预警系统资源调度方法 总被引:1,自引:0,他引:1
对面向导弹预警任务的天基预警系统中的低轨卫星资源调度问题进行了研究.对预警任务的特性进行分析,提出了一种预警任务规划与分解方法以减少任务对资源占用时间的需求;在此基础上建立了该问题的约束满足CSP调度模型;针对该模型变量多、解空间规模庞大的特点以及对求解算法时效性的要求,设计了一种基于局部解空间跳出机制的改进型遗传算法MGA.仿真表明该模型与算法在给定时间内能够得到满意的调度方案. 相似文献
314.
利用多属性群决策方法和多目标规划理论,建立了筛选武器装备维修备件的模型和方法.该方法首先按照多属性群决策方法对各种维修备件进行综合排序,然后再用多目标规划理论确定维修备件的选择方案.对该方法具体应用时的若干问题也进行了探讨. 相似文献
315.
由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。 相似文献
316.
利用Mann迭代技巧,讨论了不具有紧性条件的随机非单调二元算子方程随机不动点的存在唯一性,并给出了迭代序列收敛于解的误差估计,所得结果是某些已知结果的本质改进和推广。 相似文献
317.
汪泽焱 《国防科技大学学报》2002,24(4):37-41
为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性 相似文献
318.
We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
319.
320.
This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献