首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   130篇
  免费   14篇
  国内免费   1篇
  2023年   1篇
  2022年   1篇
  2020年   3篇
  2019年   2篇
  2018年   1篇
  2017年   2篇
  2016年   1篇
  2015年   5篇
  2014年   8篇
  2013年   4篇
  2012年   8篇
  2011年   13篇
  2010年   8篇
  2009年   8篇
  2008年   10篇
  2007年   16篇
  2006年   8篇
  2005年   6篇
  2004年   9篇
  2003年   2篇
  2002年   6篇
  2001年   6篇
  2000年   5篇
  1999年   3篇
  1998年   3篇
  1997年   4篇
  1996年   1篇
  1994年   1篇
排序方式: 共有145条查询结果,搜索用时 15 毫秒
91.
This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
92.
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  相似文献   
93.
In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
94.
In some supply chains serious disruptions are system wide. This happens during periods of severe weather, as when storms cause shuttle tankers serving oil platforms in the North Sea to stop movements of crude oil, barges are frozen in the Mississippi, or all airplanes are grounded after a blizzard. Other notable instances of system‐wide disruption happened after the attack on the World Trade Center when all aircraft were grounded and the natural gas and crude‐oil pipelines were tangled by hurricanes in 2005. We model a situation where shutting down supply facilities is very difficult and expensive because of excessive inventory buildup from an inability to move out the production. We present a planning model that balances the cost of spare capacity versus shutting down production when planning for disruptions. The model uses an assignment model embedded in a simulation. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
95.
The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
96.
根据院校教材的需求特点及自印教材的费用发生特点,研究提出了3种适合于院校自印教材印量决策的随机库存模型.所提出的模型实用性强,对节省院校教材保障经费将起到直接的作用.  相似文献   
97.
分析了备件库存管理所对应的库存控制策略及其有关的因素,以费用为目标函数、不缺备件概率为约束条件,运用概率论及库存论原理建立了备件库存限量的决策摸型。  相似文献   
98.
This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001  相似文献   
99.
A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000  相似文献   
100.
In this paper the inventory problem with backorders both deterministic and stochastic is studied using trade-off analysis in the context of vector optimization theory. The set of Pareto-optimal solutions is geometrically characterized in both the constrained and unconstrained cases. Moreover, a new way of utilizing Pareto-optimality concepts to handle classical inventory problems with backorders is derived. A new analysis of these models is done by means of a trade-off analysis. New solutions are shown, and an error bound for total inventory cost is provided. Other models such as multi-item or stochastic lead-time demand inventory problems are addressed and their Pareto-optimal solution sets are obtained. An example is included showing the additional applicability of this kind of analysis to handle parametric problems. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 83–98, 1998  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号