On-line scheduling on a batch machine to minimize makespan with limited restarts |
| |
Authors: | Ruyan Fu Jinjiang Yuan Cheng He |
| |
Affiliation: | a Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China b Institution of Science, Information Engineering University of PLA, Zhengzhou, Henan 450051, China |
| |
Abstract: | ![]() We study the on-line scheduling on an unbounded batch machine to minimize makespan. In this model, jobs arrive over time and batches are allowed limited restarts. Any batch that contains a job which has already been restarted once cannot be restarted any more. We provide a best possible on-line algorithm for the problem with a competitive ratio . |
| |
Keywords: | On-line scheduling Batch machine Restart Competitive ratio |
本文献已被 ScienceDirect 等数据库收录! |
|