摘要

This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n(5)) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n(3)) time.

全文