Article ID Journal Published Year Pages File Type
1142608 Operations Research Letters 2010 6 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Integrated production and distribution scheduling with committed delivery dates
Authors
, , ,