全文获取类型
收费全文 | 578篇 |
免费 | 104篇 |
国内免费 | 4篇 |
出版年
2022年 | 1篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 25篇 |
2018年 | 26篇 |
2017年 | 38篇 |
2016年 | 36篇 |
2015年 | 23篇 |
2014年 | 30篇 |
2013年 | 118篇 |
2012年 | 30篇 |
2011年 | 28篇 |
2010年 | 30篇 |
2009年 | 25篇 |
2008年 | 31篇 |
2007年 | 40篇 |
2006年 | 30篇 |
2005年 | 24篇 |
2004年 | 25篇 |
2003年 | 18篇 |
2002年 | 19篇 |
2001年 | 17篇 |
2000年 | 14篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有686条查询结果,搜索用时 15 毫秒
641.
This article deals with supply chain systems in which lateral transshipments are allowed. For a system with two retailers facing stochastic demand, we relax the assumption of negligible fixed transshipment costs, thus, extending existing results for the single‐item case and introducing a new model with multiple items. The goal is to determine optimal transshipment and replenishment policies, such that the total centralized expected profit of both retailers is maximized. For the single‐item problem with fixed transshipment costs, we develop optimality conditions, analyze the expected profit function, and identify the optimal solution. We extend our analysis to multiple items with joint fixed transshipment costs, a problem that has not been investigated previously in the literature, and show how the optimality conditions may be extended for any number of items. Due to the complexity involved in solving these conditions, we suggest a simple heuristic based on the single‐item results. Finally, we conduct a numerical study that provides managerial insights on the solutions obtained in various settings and demonstrates that the suggested heuristic performs very well. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 637–664, 2014 相似文献
642.
针对车载捷联惯导(SINS)在外部传感器失效时无法实现动基座对准的问题,提出了基于车辆运动模型辅助的动基座对准方法。与传统方法不同的是,该方法利用车辆在路面上的运动特性,利用车辆运动模型测得的虚拟观测量来提供辅助信息,从而实现SINS的动基座对准,仿真结果表明:对于中等精度惯导,在外部传感器失效时,利用车辆运动模型提供的辅助信息,水平对准精度为0.37°,方位对准精度为5.86°,对准时间小于150 s,依然能够快速有效地实现动基座对准。 相似文献
643.
Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this article, we study a biobjective economic lot‐sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot‐sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot‐sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an ‐hard task in general. Finally, we shed some light on the task of describing the Pareto frontier. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014 相似文献
644.
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 相似文献
645.
We give necessary and sufficient conditions based on signatures to obtain distribution‐free stochastic ordering properties for coherent systems with exchangeable components. Specifically, we consider the stochastic, the hazard (failure) rate, the reversed hazard rate, and the likelihood ratio orders. We apply these results to obtain stochastic ordering properties for all the coherent systems with five or less exchangeable components. Our results extend some preceding results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
646.
We consider a discrete‐time groundwater model in which the cost of pumping takes a slightly different form to that which has been traditional in the research literature to date. This enables us to prove that (a) the optimal pumping quantity is nondecreasing in the ground water stock, (b) the stock level remaining after each period's pumping is also nondecreasing in the groundwater stock, (c) the optimal decision is determined by maximizing a concave function, and finally (d) the optimal pumping quantity is nonincreasing in the number of periods to go. We show that (a)–(c), while intuitive, do not hold under traditional modeling assumptions. We also explain the connections between our results and similar ones for some classic problems of operations research. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2011 相似文献
647.
在组件化建模与仿真领域内,基于BOM规范的组件建模与仿真环境KD-SmartSim得到了广泛应用,它通过RTI实现了组件仿真系统的并行运算,但是其运行性能较低.讨论了KD-SmartSim系统存在的不足,在继承其基于BOM规范组件建模的基础上,提出了新的支持组件并行化计算的结构,设计了SPMD运行模式的并行组件仿真引擎... 相似文献
648.
马双成 《中国人民武装警察部队学院学报》2011,(8):93-94
针对现有主机监控系统存在的执行效率低、监控粒度粗等问题,通过在内核态设置钩子函数改写系统服务调度表,同时在用户层设置策略库进行细粒度监控,设计并实现了主机安全监控系统。该系统具有执行效率高、占用系统资源少、监控粒度细等特点。 相似文献
649.
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 相似文献
650.
We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献