科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider the online scheduling of equal length jobs on unbounded parallel batch processing machines to minimize makespan with limited restart. In the problem identical unbounded parallel batch processing machines are available to process the equal length jobs arriving over time. The processing batches are allowed limited restart. Here, "restart" means that a running task may be interrupted, losing all the work done on it, and the jobs in the interrupted task are then released and become independently unscheduled jobs, called restarted jobs. "Limited restart" means that only a running batch that contains no restarted jobs can be restarted. For this problem, we present a best possible online algorithm.
