Dynamic batching policies for an on-demand video server
Multimedia Systems
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling a batch processing machine with incompatible job families
Computers and Industrial Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Mathematical sciences in the nineties
IBM Journal of Research and Development
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
A robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved approximation algorithms for broadcast scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms (TALG)
Mathematics of Operations Research
Scheduling algorithms for broadcasting media with multiple distortion measures
IEEE Transactions on Wireless Communications
Broadcast scheduling: Algorithms and complexity
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Design and analysis of online batching systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Optimal batch schedules for parallel machines
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |
We consider the following scheduling with batching problem that has many applications, e.g., 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 non-explicitly), 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 non-preemptive 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 show exact algorithms for several special cases.