Abstract: Aiming at the make-to-order enterprises with commit-to-delivery,the existing researches were expanded to multi-plant layout to investigate the integrated scheduling of order assignment and production-delivery,which could minimize the total costs of production and transportation.The analysis result showed the computing complexity of NP-Hard for this problem,and a three-steps heuristics method of polynomial time complexity was proposed.The result indicated that the worst case performance of this method was bounded by Lmax+1,and the  near-optimal solution would generate and the tight bounds would obtain by this method.

Key words: commit-to-delivery, make-to-order, integrated optimization, heuristic method

摘要： 针对采用限时送达方式的订单式生产企业,将现有研究扩展到多工厂布局,研究如何安排订单分派和生产运送的联合调度,从而最小化生产成本和配送成本。分析表明该问题具有NP-Hard的计算复杂性,随后提出一种具有多项式时间复杂性的三步骤启发式方法。理论分析表明,该启发式方法的最坏绩效以Lmax+1为边界,且实验分析表明该方法可以生成几近最优的解,得到非常紧的上下边界。

关键词: 限时送达, 订单式生产, 集成优化, 启发式方法