Bounded serial-batching scheduling for minimizing maximum lateness and makespan

For the serial-batching scheduling problem to minimize maximum lateness and makespan simultaneously, when the batch capacity bb is unbounded, we have presented an O(n2)O(n2)-time algorithm. In this paper, we concentrate on the corresponding bounded model of the bicriteria scheduling problem. We obtain an O(n6)O(n6)-time algorithm to find all Pareto optimal solutions. Moreover, for the special case where the processing times and deadlines are agreeable, we present an O(n3)O(n3)-time algorithm to find all Pareto optimal solutions. On the other hand, as a result of our main algorithm, we solve the open problem of minimizing maximum lateness on the single bounded serial-batching machine.