排序方式: 共有228条查询结果,搜索用时 15 毫秒
101.
Johan Marklund 《海军后勤学研究》2011,58(1):59-71
This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011 相似文献
102.
片上网络逐渐成为片上众核中非常有前景的互连方式.基于目录的cache一致性协议的维护需要片上互连网络高效的支持多播.在借鉴单播的网络吞吐率模型基础上,建立了面向多播的网络吞吐率模型和体系结构级的能量模型.相对于传统的多播路由算法,负载平衡维序路由算法(BDoR)和最小路径维序路由算法(MPDoR)通过平衡X和Y两个方向... 相似文献
103.
In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
104.
根据联合申请的备件品种范围的不同,提出了3种订货策略,即单独申请、统一申请和联合申请,并设计了联合申请策略的启发式算法。该算法首先确定订购最频繁的备件,将其申请周期作为基本申请周期,其他备件申请周期是该周期的整倍数;其次寻求各种备件的最优订货倍数;最后确定各种备件的订购量。数值实例表明:联合申请策略的聚集效应明显优于单独申请策略和统一申请策略,对多品种库存控制策略的研究有一定意义。 相似文献
105.
106.
针对初始库存和终止库存不为零的生产与库存问题,通过适当设置需求量,将其化为初始库存和终止库存为零的问题,以便应用重生性质进行求解。 相似文献
107.
互连网络是大规模并行计算机的重要组成部分,路由算法是其中决定网络性能的重要因素,本文在直接网络结构基础上对路由算法进行讨论,给出了一种分类方法,并着重对采用虫孔路由开关技术的自适应路由算法进行分析,为进一步的评价和设计新的算法提供了参考。 相似文献
108.
针对空中骨干Mesh网络资源有限、计算能力相对不足的特点以及传统简单机会路由(Simple Opportunistic Adaptive Routing,SOAR)路由算法未充分考虑负载均衡与不同业务服务质量(Quality of Service,Qo S)保障需求差异性的问题,提出一种支持业务区分的改进型SOAR路由算法。该算法在考虑链路拥塞控制和负载均衡的基础上,定义综合预期传输次数来描述链路的综合状态,有效降低网络拥塞概率;同时根据传输业务类型的不同,设计一种基于层次分析法的路由选择策略,实现路径选择与业务类型的动态匹配。仿真结果表明,在重负载条件下,改进型SOAR路由算法相比传统SOAR路由算法其时延、吞吐量和吞吐率性能明显提升。当网络中存在不同类型业务时,改进型SOAR路由算法能够根据业务Qo S保障需求的差异性自适应选择最佳传输路径。 相似文献
109.
We consider a problem of optimal division of stock between a logistic depot and several geographically dispersed bases, in a two‐echelon supply chain. The objective is to minimize the total cost of inventory shipment, taking into account direct shipments between the depot and the bases, and lateral transshipments between bases. We prove the convexity of the objective function and suggest a procedure for identifying the optimal solution. Small‐dimensional cases, as well as a limit case in which the number of bases tends to infinity, are solved analytically for arbitrary distributions of demand. For a general case, an approximation is suggested. We show that, in many practical cases, partial pooling is the best strategy, and large proportions of the inventory should be kept at the bases rather than at the depot. The analytical and numerical examples show that complete pooling is obtained only as a limit case in which the transshipment cost tends to infinity. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 3–18, 2017 相似文献
110.
针对容忍延迟网络(DTN)高延迟、数据传输成功率低等问题,提出了一种基于节点综合效能的DTN路由算法SERA。该算法综合考虑移动节点的活跃度和剩余能量,使消息副本向综合效能高的节点扩散。SERA节点活跃度描述了节点的社会和动态特性,SERA尽量将消息副本传递给活跃度高的节点,以提高消息传输的成功率;在选择中继节点时,充分考虑节点的能量状态,以避免能量不足的节点承担更多的信息传输任务,从而提高网络节点的存活率。仿真结果表明,与典型的DTN路由算法相比,SERA能够更好地平衡节点的能耗,获得更高的消息递交成功率和更长的网络生存期。 相似文献