Online Scheduling on a Parallel Batch Machine with Delivery Times and Limited Restarts

被引：0
作者：
Hai-Ling Liu
Xi-Wen Lu
机构：
[1] East China University of Science and Technology,Department of Mathematics
[2] Henan University of Engineering,College of Science
来源：
Journal of the Operations Research Society of China | 2022年 / 10卷
关键词：
Online scheduling; Parallel batch; Limited restart; Delivery time; 90B35;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The online scheduling on an unbounded parallel batch machine with delivery times and limited restarts is studied in this paper. Here, online means that jobs arrive over time and the characteristics of a job become known until it arrives. Limited restarts mean that once a running batch contains at least one restarted job, it cannot be restarted again. The goal is to minimize the time by which all jobs have been delivered. We consider a restricted model that the delivery time of each job is no more than its processing time. We present a best possible online algorithm with a competitive ratio of 3/2 for the problem.
引用
收藏
页码：113 / 131
页数：18
相关论文
共 32 条
[1]  
Lee CY(1992)Efficient algorithms for scheduling semi-conductor burn-in operations Oper. Res. 40 764-775
[2]  
Uzsoy R(2003)Supply chain scheduling: batch and delivery Oper. Res. 51 566-583
[3]  
Martin-Vega LA(2009)The coordination of transportation and batching scheduling Appl. Math. Model. 33 3854-3862
[4]  
Hall NG(1995)Scheduling parallel machines on-line SIAM J. Comput. 24 1313-1331
[5]  
Potts CN(2000)Restarts can help in the online minimization of the maximum delivery time on a single machine J. Sched. 3 333-341
[6]  
Tang LX(2008)On-line scheduling on a batch machine to minimize makespan with limited restarts Oper. Res. Lett. 36 255-258
[7]  
Gong H(2009)A best on-line scheduling for the single machine parallel-batch scheduling with restricted delivery time J. Comb. Optim. 17 206-213
[8]  
Shmoys DB(2012)An improved on-line algorithm for single parallel-batch machine scheduling with delivery times Discrete Appl. Math. 160 1191-1210
[9]  
Wein J(2011)A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan J. Sched. 14 361-369
[10]  
Williamson DP(2016)Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart J. Comb. Optim. 31 1609-1622
1234