One-pass batching algorithms for the one-machine problem

Abstract We study the problem of batching jobs which must be processed on a single machine. In the case the jobs are all of one type and if we want to minimize the sum of completion times, we show that the greedy algorithm solves this problem. In the case of various job types we give a heuristic which has given outstanding results on randomly generated examples.