摘要
本文将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.
出处
《物流科技》
2007年第2期127-130,共4页
Logistics Sci-Tech
基金
四川省学术带头人培养基金([2001]16)资助
四川省教育厅自然科学基金资助(重点项目
[2006]A067)
关键词
供应链
最优化
订单装配
启发式算法
排队群
supply chain
optimization
assemble-to-order
greedy-type algorithm
set of queues