3 research outputs found
An Improved Algorithm for a Bicriteria Batching Scheduling Problem
This note is concerned with the bicriteria scheduling problem on a series-batching
machine to minimize maximum cost and makespan. An
O(n5) algorithm has been established
previously. Here is an improved algorithm which solves the problem in
O(n3) time