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.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
- Fixed departure dates
- Integrated production and distribution
- Maximum lateness