Integrated optimization of order assignment and joint production-transportation scheduling with commit-to-delivery mode

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 L_max+1, and the near-optimal solution would generate and the tight bounds would obtain by this method.