scholarly journals Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart

2014 ◽  
Vol 543 ◽  
pp. 24-36 ◽  
Author(s):  
Hailing Liu ◽  
Jinjiang Yuan
Keyword(s):  
Online Scheduling ◽  
Equal Length ◽  
Batch Machine

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.

Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery

2018 ◽  
Vol 35 (04) ◽  
pp. 1850026
Author(s):  
Qijia Liu ◽  
Jinjiang Yuan
Keyword(s):  
Competitive Ratio ◽  
Completion Time ◽  
Online Algorithm ◽  
Online Scheduling ◽  
Equal Length ◽  
Batch Machine ◽  
Job Delivery ◽  
Over Time

In this paper, we consider the online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery. The jobs arrive online over time and belong to [Formula: see text] incompatible job families, where [Formula: see text] is known in advance. The jobs are first processed in batches on an unbounded parallel-batch machine and then the completed jobs are delivered in batches by a vehicle with infinite capacity to their customers. The jobs from distinct families cannot be processed and delivered in the same batch. The objective is to minimize the maximum delivery completion time of the jobs. For this problem, we present an online algorithm with the best competitive ratio of [Formula: see text].

ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES

2007 ◽  
Vol 18 (02) ◽  
pp. 251-262 ◽  
Author(s):  
CHUNG KEUNG POON ◽  
FEIFENG ZHENG ◽  
YINFENG XU
Keyword(s):  
Delivery Systems ◽  
Online Scheduling ◽  
Equal Length ◽  
Data Delivery ◽  
Scheduling Problem ◽  
Broadcast Scheduling ◽  
On Demand ◽  
Special Case ◽  
Modified Algorithm

We investigate an online scheduling problem motivated by pull-based data delivery systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. We focus on the special case where preemption is allowed but aborted requests can never be satisfied again. The HEU algorithm of Woeginger [10] is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modified algorithm, VAR, which is optimal for this case.

Online Scheduling of Equal-Length Jobs on Parallel Machines

2007 ◽  
pp. 427-438 ◽  
Author(s):  
Jihuan Ding ◽  
Tomáš Ebenlendr ◽  
Jiří Sgall ◽  
Guochuan Zhang
Keyword(s):  
Parallel Machines ◽  
Online Scheduling ◽  
Equal Length

Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help

2007 ◽  
Vol 36 (6) ◽  
pp. 1709-1728 ◽  
Author(s):  
Marek Chrobak ◽  
Wojciech Jawor ◽  
Jiří Sgall ◽  
Tomáš Tichý
Keyword(s):  
Online Scheduling ◽  
Equal Length
Sign in / Sign up

Export Citation Format

Share Document