Online scheduling algorithm for parallel batch processing machines


This paper studies two online scheduling problems on parallel machines that process computing jobs arriving stochastically in a batch pattern. With the objective function as minimizing total completion time of weighted jobs or minimizing total latency of job completion, we propose two solutions for above scheduling problems, respectively. With the… (More)

4 Figures and Tables


  • Presentations referencing similar topics