Article ID Journal Published Year Pages File Type
1142328 Operations Research Letters 2013 4 Pages PDF
Abstract

An integrated production and distribution scheduling problem is considered. A set of orders is first processed on a single production line. Completed orders are then delivered to customers by a finite number of vehicles. We give polynomial-time algorithms for minimizing: (1) the maximum lateness of orders, (2) the number of vehicles used subject to the condition that the maximum lateness is minimum, (3) the weighted sum of the maximum lateness and the number of vehicles used.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,