Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs

Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs

0.00 Avg rating0 Votes
Article ID: iaor2014850
Volume: 8
Issue: 5
Start Page Number: 1691
End Page Number: 1706
Publication Date: Jun 2014
Journal: Optimization Letters
Authors: ,
Keywords: batch processes, tardiness
Abstract:

We consider the online scheduling of equal‐length jobs with incompatible families on m equ1 identical batch machines. Each job has a release time, a deadline and a weight. Each batch machine can process up to b equ2 jobs (which come from the same family) simultaneously as a batch, where b equ3 is called the capacity of the machines. Our goal is to determine a preemption‐restart schedule which maximizes the weighted number of early jobs. For this problem, Li et al. (Inf Process Lett 112:503–508, 2012) provided an online algorithm of competitive ratio 3 + 2 2 equ4 for both b = equ5 and b < equ6 . In this paper, we study two special cases of this problem. For the case that m = 2 equ7 , we first present a lower bound 2, and then provide an online algorithm with a competitive ratio of 3 for both b = equ8 and b < equ9 . For the case in which m = 3 equ10 , b = equ11 and all jobs come from a common family, we present an online algorithm with a competitive ratio of ( 8 + 2 15 ) / 3 5.249 equ12 .

Reviews

Required fields are marked *. Your email address will not be published.