摘要
在某些假设前提下,以一定时期内从某个储位取出某种品项人力所做的总功最小为目标,建立了人工拣货系统中简单往返拣货的线性规划模型,并用简单实用的密度-周转率索引算法来求解模型。理论证明密度-周转率索引算法所求解为模型的最优解。最后用算例验证了模型的有效性。
Under some assumptions, a linear programming model for simple out and-back warehouse operation was developed with the objective of minimizing the workload required for order picking operation. It was proved that the storage location rule of density-turnover index generates an optimal solution for the model. Finally, the correctness and validity of the proposed method was verified by a simulated example.
出处
《包装工程》
CAS
CSCD
北大核心
2009年第11期100-103,共4页
Packaging Engineering
基金
湖北省教育厅科学技术重点项目(D20081203)
关键词
储位指派
密度
周转率索引
能耗
storage location assignment
density-turnover index
workload
