Abstract
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 is developed, and computational experience is reported.
| Original language | English |
|---|---|
| Pages (from-to) | 521-525 |
| Number of pages | 5 |
| Journal | Naval Research Logistics Quarterly |
| Volume | 26 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1979 |