Supply Chain Scheduling Problems with Setup Times and Batch Scheduling

This paper studies the problem of single manufacture and multiple customers.Some jobs from the same customer can be processed at the same time;but the jobs from different customers can't be processed in the same batch.When the jobs of adjacent batches belong to different customers,there should be a related setup time.We use total weighted completion time and the maximum lateness as scheduling objective separately.We adopt the technique of dynamical programming to establish the integrated scheduling models.Then we give the optimal algorithms and analyze their complexity.