首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   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条查询结果,搜索用时 796 毫秒
41.
We consider preventive transshipments between two stores in a decentralized system with two demand subperiods. Replenishment orders are made before the first subperiod, and the stores may make transshipments to one another between the subperiods. We prove that the transshipment decision has a dominant strategy, called a control‐band conserving transfer policy, under which each store chooses a quantity to transship in or out that will keep its second‐subperiod starting inventory level within a range called a control band. We prove that the optimal replenishment policy is a threshold policy in which the threshold depends on the capacity level at the other store. Finally, we prove that there does not exist a transfer price that coordinates the decentralized supply chain. Our research also explains many of the differences between preventive and emergency transshipments, including differences in the optimal transfer policies and the existence or nonexistence of transfer prices that coordinate the system. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
42.
In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003  相似文献   
43.
针对随机需求条件下的虚拟物流库存控制问题进行了深入研究,提出了一种新的联合库存控制策略——(T,S,s)策略,建立了相应的库存成本模型,并构造遗传算法对模型进行求解。结果分析表明,所提出的(T,S,S)联合库存控制策略是有效的。  相似文献   
44.
In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
45.
In this article we address an important class of supply contracts called the Rolling Horizon Flexibility (RHF) contracts. Under such a contract, at the beginning of the horizon a buyer has to commit requirements for components for each period into the future. Usually, a supplier provides limited flexibility to the buyer to adjust the current order and future commitments in a rolling horizon manner. We present a general model for a buyer's procurement decision under RHF contracts. We propose two heuristics and derive a lower bound. Numerically, we demonstrate the effectiveness of the heuristics for both stationary and non‐stationary demands. We show that the heuristics are easy to compute, and hence, amenable to practical implementation. We also propose two measures for the order process that allow us to (a) evaluate the effectiveness of RHF contracts in restricting the variability in the orders, and (b) measure the accuracy of advance information vis‐a‐vis the actual orders. Numerically we demonstrate that the order process variability decreases significantly as flexibility decreases without a dramatic increase in expected costs. Our numerical studies provide several other managerial insights for the buyer; for example, we provide insights into how much flexibility is sufficient, the value of additional flexibility, the effect of flexibility on customer satisfaction (as measured by fill rate), etc. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
46.
We consider a distribution system consisting of a central warehouse and a group of retailers facing independent stochastic demand. The retailers replenish from the warehouse, and the warehouse from an outside supplier with ample supply. Time is continuous. Most previous studies on inventory control policies for this system have considered stock‐based batch‐ordering policies. We develop a time‐based joint‐replenishment policy in this study. Let the warehouse set up a basic replenishment interval. The retailers are replenished through the warehouse in intervals that are integer multiples of the basic replenishment interval. No inventory is carried at the warehouse. We provide an exact evaluation of the long‐term average system costs under the assumption that stock can be balanced among the retailers. The structural properties of the inventory system are characterized. We show that, although it is well known that stock‐based inventory control policies dominate time‐based inventory control policies at a single facility, this dominance does not hold for distribution systems with multiple retailers and stochastic demand. This is because the latter can provide a more efficient mechanism to streamline inventory flow and pool retailer demand, even though the former may be able to use more updated stock information to optimize system performance. The findings of the study provide insights about the key factors that drive the performance of a multiechelon inventory control system. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 637–651, 2013  相似文献   
47.
舰艇出海执行任务期间,需要携行一定种类和数量的物资自给。文中研究了这种单级供应条件下,如何确定备件最优携行量的问题。建立了以服务水平为目标,以资源为约束的目标规划模型,模型考虑了随机提前期和备件重要度。提出一种基于边际效费比的增量法用于求解这个模型。最后,给出一个算例并得到了一些结论。  相似文献   
48.
This paper considers a discrete time, single item production/inventory system with random period demands. Inventory levels are reviewed periodically and managed using a base‐stock policy. Replenishment orders are placed with the production system which is capacitated in the sense that there is a single server that sequentially processes the items one at a time with stochastic unit processing times. In this setting the variability in demand determines the arrival pattern of production orders at the queue, influencing supply lead times. In addition, the inventory behavior is impacted by the correlation between demand and lead times: a large demand size corresponds to a long lead time, depleting the inventory longer. The contribution of this paper is threefold. First, we present an exact procedure based on matrix‐analytic techniques for computing the replenishment lead time distribution given an arbitrary discrete demand distribution. Second, we numerically characterize the distribution of inventory levels, and various other performance measures such as fill rate, base‐stock levels and optimal safety stocks, taking the correlation between demand and lead times into account. Third, we develop an algorithm to fit the first two moments of the demand and service time distribution to a discrete phase‐type distribution with a minimal number of phases. This provides a practical tool to analyze the effect of demand variability, as measured by its coefficient of variation, on system performance. We also show that our model is more appropriate than some existing models of capacitated systems in discrete time. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
49.
This paper develops an inventory model that determines replenishment strategies for buyers facing situations in which sellers offer price‐discounting campaigns at random times as a way to drive sales or clear excess inventory. Specifically, the model deals with the inventory of a single item that is maintained to meet a constant demand over time. The item can be purchased at two different prices denoted high and low. We assume that the low price goes into effect at random points in time following an exponential distribution and lasts for a random length of time following another exponential distribution. We highlight a replenishment strategy that will lead to the lowest inventory holding and ordering costs possible. This strategy is to replenish inventory only when current levels are below a certain threshold when the low price is offered and the replenishment is to a higher order‐up‐to level than the one currently in use when inventory depletes to zero and the price is high. Our analysis provides new insight into the behavior of the optimal replenishment strategy in response to changes in the ratio of purchase prices together with changes in the ratio of the duration of a low‐price period to that of a high‐price period. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
50.
一类带容量限制的运输问题   总被引:11,自引:2,他引:9  
考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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