基于M^(X_i)_i/D_i/∞排队群的订单装配优化模型与算法  

Optimization Model of an Assemble-to-order Based on M^(X_i)_i/D_i/∞ in Supply Chain

作　　者：吴倩[1] 孟庆宇[1] 唐应辉[2] 

机构地区：[1]电子科技大学,四川成都610054 [2]四川师范大学,四川成都610054

出　　处：《物流科技》2007年第2期127-130,共4页Logistics Sci-Tech

基　　金：四川省学术带头人培养基金([2001]16)资助;四川省教育厅自然科学基金资助(重点项目;[2006]A067)

摘　　要：本文将M^(X_i)_i/D_i/∞排队群引入供应链的订单装配模型中,采用启发式算法研究了稳态下基于组件基本存货水平、组件立即满足率的组件拖欠成本和持有成本的优化问题,从而找出了最优的组件基本存货水平,并给出了相应的数值例子。We introduce set of queues Mi^Xi/Di/∞ into assemble-to-order.We study an optimization problem to determine the optimal component base-stock levels：minimizing expected number of component backorders and the average component inventory on hand in steady state subject to an upper limit on the total component inventory investment and a components fill rate.We also give its corresponded numerical examples by greedy-type algorithm.

关 键 词：供应链 最优化 订单装配 启发式算法 排队群 

分 类 号：O213.2[理学—概率论与数理统计]