Improvement and Perfection of the Minimum Coefficient Method for Sorting Problems in Logistics Processing
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.
NETL
NSTL
万方数据
