Integrated production and distribution scheduling with committed delivery dates

We consider an integrated production–distribution scheduling problem in the context of a commit-to-delivery business model. The problem is strongly NP-hard. We propose a polynomial-time heuristic algorithm and show that its worst-case performance ratio is bounded by 2 and that this bound is tight.