全文获取类型
收费全文 | 234篇 |
免费 | 86篇 |
国内免费 | 18篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 13篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 15篇 |
2012年 | 15篇 |
2011年 | 11篇 |
2010年 | 10篇 |
2009年 | 23篇 |
2008年 | 17篇 |
2007年 | 20篇 |
2006年 | 25篇 |
2005年 | 14篇 |
2004年 | 17篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有338条查询结果,搜索用时 15 毫秒
191.
针对我军配套装备器材订货的特点,在考虑库存容量空间限制与整套装备的最低期望满足率两种约束条件下,建立了配套装备器材的库存与运输优化模型,并应用改进的动态规划方法进行求解。结果表明:应用库存与运输的优化模型,在保障军事目标实现的前提下,有效地降低了物流成本。 相似文献
192.
在流编程模型下建立了一个新的存储一致性模型--流一致性模型,它比传统的释放一致性模型更加松弛.讨论了流一致性模型对程序设计和系统设计的要求,给出了一个正确的系统实现,并且指出流一致性模型的编程和实现并不比现有的一致性模型复杂. 相似文献
193.
We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
194.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
195.
Machine learning algorithms that incorporate misclassification costs have recently received considerable attention. In this paper, we use the principles of evolution to develop and test an evolutionary/genetic algorithm (GA)‐based neural approach that incorporates asymmetric Type I and Type II error costs. Using simulated, real‐world medical and financial data sets, we compare the results of the proposed approach with other statistical, mathematical, and machine learning approaches, which include statistical linear discriminant analysis, back‐propagation artificial neural network, integrated cost preference‐based linear mathematical programming‐based minimize squared deviations, linear integrated cost preference‐based GA, decision trees (C 5.0, and CART), and inexpensive classification with expensive tests algorithm. Our results indicate that the proposed approach incorporating asymmetric error costs results in equal or lower holdout sample misclassification cost when compared with the other statistical, mathematical, and machine learning misclassification cost‐minimizing approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
196.
付立柱 《中国人民武装警察部队学院学报》2006,22(3):89-90
当前,我国消防经费的规模随着消防事业的迅速发展正日益扩大。如何加强消防经费的管理,实现有限的经费效益最大化,确保消防部队的发展和建设显得尤为重要。通过分析现阶段消防经费管理和使用中存在的一些普遍问题,就提高消防部队经费使用效益问题,谈了几点意见。 相似文献
197.
198.
In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
199.
Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
200.
This article is concerned with the determination of pricing strategies for a firm that in each period of a finite horizon receives replenishment quantities of a single product which it sells in two markets, for example, a long‐distance market and an on‐site market. The key difference between the two markets is that the long‐distance market provides for a one period delay in demand fulfillment. In contrast, on‐site orders must be filled immediately as the customer is at the physical on‐site location. We model the demands in consecutive periods as independent random variables and their distributions depend on the item's price in accordance with two general stochastic demand functions: additive or multiplicative. The firm uses a single pool of inventory to fulfill demands from both markets. We investigate properties of the structure of the dynamic pricing strategy that maximizes the total expected discounted profit over the finite time horizon, under fixed or controlled replenishment conditions. Further, we provide conditions under which one market may be the preferred outlet to sale over the other. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 531–549, 2015 相似文献