scholarly journals On-line scheduling with delivery time on a single batch machine

2007 ◽  
Vol 374 (1-3) ◽  
pp. 49-57 ◽  
Author(s):  
Ji Tian ◽  
Ruyan Fu ◽  
Jinjiang Yuan
Keyword(s):  
Delivery Time ◽  
Batch Machine ◽  
On Line ◽  
Single Batch

scholarly journals Online Scheduling with Delivery Time on a Bounded Parallel Batch Machine with Limited Restart

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Hailing Liu ◽  
Long Wan ◽  
Zhigang Yan ◽  
Jinjiang Yuan
Keyword(s):  
Positive Solution ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Online Scheduling ◽  
Equal Length ◽  
Delivery Time ◽  
Batch Machine ◽  
Time Scheduling ◽  
Work Done ◽  
Over Time

We consider the online (over time) scheduling of equal length jobs on a bounded parallel batch machine with batch capacitybto minimize the time by which all jobs have been delivered with limited restart. Here, “restart” means that a running batch may be interrupted, losing all the work done on it, and jobs in the interrupted batch are then released and become independently unscheduled jobs, called restarted jobs. “Limited restart” means that a running batch which contains some restarted jobs cannot be restarted again. Whenb=2, we propose a best possible online algorithmH(b=2)with a competitive ratio of1+α, whereαis the positive solution of2α(1+α)=1. Whenb≥3, we present a best possible online algorithmH(b≥3)with a competitive ratio of1+β, whereβis the positive solution ofβ(1+β)2=1.

On-line scheduling on a batch machine to minimize makespan with limited restarts

2008 ◽  
Vol 36 (2) ◽  
pp. 255-258 ◽  
Author(s):  
Ruyan Fu ◽  
Ji Tian ◽  
Jinjiang Yuan ◽  
Cheng He
Keyword(s):  
Batch Machine ◽  
On Line

Single batch machine scheduling with deliveries

2015 ◽  
Vol 62 (6) ◽  
pp. 470-482 ◽  
Author(s):  
B.-Y. Cheng ◽  
J.Y.-T. Leung ◽  
K. Li ◽  
S.-L. Yang
Keyword(s):  
Machine Scheduling ◽  
Batch Machine ◽  
Single Batch
Sign in / Sign up

Export Citation Format

Share Document