Integration of finished goods batch delivery into production scheduling via total tardiness minimization

This study examined together machine scheduling and finished–product batch delivery. Particularly, this study considered all jobs required different storage space during delivery. Three single–machine scheduling models are developed that considered transportation time of a single delivery vehicle serving one customer area. Two of the models considered release time, the other does not. All models are developed using integer programming to optimally solve the problem. In doing so, total tradiness is minimized. The problem is NP–hard in the strong sense in general. The results of a computational experiment were reported as well.