| Article ID: | iaor20101733 |
| Volume: | 38 |
| Issue: | 2 |
| Start Page Number: | 133 |
| End Page Number: | 138 |
| Publication Date: | Mar 2010 |
| Journal: | Operations Research Letters |
| Authors: | Chen Zhi-Long, Zhong Weiya, Chen Ming |
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.