Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost

In this paper we consider an unbounded model of the single machine parallel batch scheduling problem with release dates and three hierarchical criteria. The first criterion is to minimize makespan, the second criterion is to minimize machine occupation time and the third criterion is to minimize stocking cost. We solve this problem by an O(n2) time dynamic programming algorithm.