Scheduling jobs to two machines subject to batch arrival ordering

The problem considered is to assign n jobs to two processors so as to minimize the total flow time, with the constraint that a predetermined partial ordering (induced by batch arrivals) must be preserved within the subset of jobs assigned to each processor. An efficient algorithm of time 0(n⁵) is developed, and computational experience is reported.