论文部分内容阅读
研究一类集成工件加工和发送的供应链排序模型,即研究如何安排工件在自由作业机器上加工,把加工完毕的工件分批发送给下游客户,使得含生产排序费用和发送费用的目标函数最优.这里,分别取工件最大送到时间和平均送到时间为生产排序费用;而发送费用是由固定费用和与运输路径有关的变化费用组成.利用排序理论和动态规划方法,构造了自由作业供应链排序问题的多项式时间近似算法,并分析算法的性能比.
This paper studies a sort of supply chain sequencing model that integrates the processing and sending of workpieces, that is, how to arrange the workpieces to be machined on the free-running machine and send the finished workpieces to the downstream customers in batches so that the objective function including production sequencing cost and sending cost is the most Here, the maximum delivery time and the average delivery time of the workpieces are respectively the production ordering costs, while the sending costs are composed of the fixed costs and the changing costs related to the transportation routes.Using the ranking theory and the dynamic programming method, the free operation The polynomial time approximation algorithm for supply chain ranking problem and the performance ratio of the algorithm are analyzed.