TY - JOUR

T1 - Throughput maximization of real-time scheduling with batching

AU - Bar-Noy, Amotz

AU - Guha, Sudipto

AU - Katz, Yoav

AU - Naor, Joseph

AU - Schieber, Baruch

AU - Shachnai, Hadas

PY - 2009/3/1

Y1 - 2009/3/1

N2 - We consider the following scheduling with batching problem that has many applications, for example, in multimedia-on-demand and manufacturing of integrated circuits. The input to the problem consists of n jobs and k parallel machines. Each job is associated with a set of time intervals in which it can be scheduled (given either explicitly or nonexplicitly), a weight, and a family. Each family is associated with a processing time. Jobs that belong to the same family can be batched and executed together on the same machine. The processing time of each batch is the processing time of the family of jobs it contains. The goal is to find a nonpreemptive schedule with batching that maximizes the weight of the scheduled jobs. We give constant factor (4 or 4 + ε) approximation algorithms for two variants of the problem, depending on the precise representation of the input. When the batch size is unbounded and each job is associated with a time window in which it can be processed, these approximation ratios reduce to 2 and 2 + ε, respectively. We also give approximation algorithms for two special cases when all release times are the same.

AB - We consider the following scheduling with batching problem that has many applications, for example, in multimedia-on-demand and manufacturing of integrated circuits. The input to the problem consists of n jobs and k parallel machines. Each job is associated with a set of time intervals in which it can be scheduled (given either explicitly or nonexplicitly), a weight, and a family. Each family is associated with a processing time. Jobs that belong to the same family can be batched and executed together on the same machine. The processing time of each batch is the processing time of the family of jobs it contains. The goal is to find a nonpreemptive schedule with batching that maximizes the weight of the scheduled jobs. We give constant factor (4 or 4 + ε) approximation algorithms for two variants of the problem, depending on the precise representation of the input. When the batch size is unbounded and each job is associated with a time window in which it can be processed, these approximation ratios reduce to 2 and 2 + ε, respectively. We also give approximation algorithms for two special cases when all release times are the same.

KW - Batching

KW - Local ratio technique

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=67149099128&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67149099128&partnerID=8YFLogxK

U2 - 10.1145/1497290.1497294

DO - 10.1145/1497290.1497294

M3 - Article

AN - SCOPUS:67149099128

VL - 5

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

SN - 1549-6325

IS - 2

M1 - 18

ER -