Scheduling with generalized batch delivery dates and earliness penalties

In this paper, we study some single machine scheduling problems with generalized batch delivery dates and earliness penalties. The generalized delivery dates are given a-priori before any jobs are processed. They are unrelated to the jobs and the processing order. Each specific delivery batch contains jobs completed but undelivered until the specific delivery date. We consider scheduling problems to minimize two types of earliness penalties: one is the total earliness; the other is the maximum earliness. For these two problems, first we show that they are NP-hard in the strong sense for general cases; then we prove that they are still NP-hard even if there are only two generalized batch dates. We also prove that they are solved in polynomial time for general earliness penalty function if all processing times are equal, acid give an O(n log(n)) algorithm to solve the weighted earliness cases.