摘要
物流流通加工中同顺序作业排序问题(n/m/F/Cmax)是NP难问题,如何有效解决这类问题,是缩短流通加工生产周期、降低物流成本关键因素之一。现有最小系数法解法,虽然方法简单,但存在无法有效保障开始和结束区域加工时间都比较小,影响生产周期长短。为了解决这一问题,依据关键线路理论和线路条数理论,提出了兼顾比值法的优点,又很好保证开始和结束区域加工时间都比较小的多种改进措施。新解法主要借助新的系数,既作业时间之和与比值系数乘积,按新的系数排序。结果可获得满意近似最优解,有效提高优化程度,缩短生产周期。经验证,方法相对简单、易于掌握,可运用Excel软件快速获得优化顺序,有效提高优化程度。
The same-sequence job sorting problem in logistics processing(n/m/F/Cmax)is NP-hard,and effectively solving this type of problem is one of the key factors in shortening the production cycle and reducing logistics costs.The existing minimum coefficient method is simple but fails to effectively ensure that both the processing times at the beginning and end areas are relatively short,impacting the length of the production cycle.To address this issue,this study proposes various improvements based on the theory of critical paths and the number of routes,incorporating the advantages of the ratio method while ensuring that the processing times at the beginning and end areas remain relatively short.The new method primarily employs a new coefficient for the sorting process,which is the product of the total job times and the ratio coefficient.The results yield a satisfactory approximate optimal solution,effectively improving optimization and shortening the production cycle.Validation shows that the method is relatively simple and easy to master,allowing for quick optimization sequences using Excel software,thus effectively enhancing the level of optimization.
作者
贾春玉
包薇
郭美芳
JIA Chun-yu;BAO Wei;GUO Mei-fang(Guangdong Pei Zheng College,Guangzhou,Guangdong,510830,China)
出处
《武汉商学院学报》
2024年第6期83-87,共5页
Journal of Wuhan Business University
关键词
物流
流通加工
同顺序排序
最小系数法
改进方法
logistics
distribution processing
same-sequence sorting
minimum coefficient method
improvement methods
