Guo Sun

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider the problem of minimizing the total late work (n ∑ j=1 V j) on an unbounded batch processing machine, where V j = min{T j , p j } and T j = max{C j − d j , 0}. The batch processing machine can process up to B (B ≥ n) jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same(More)
  • 1