Amotz Bar-Noy
Abstract
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.
- Azizoglu, M., and Webster, S. 2001. Scheduling a batch processing machine with incompatible job families. Comput. Indust. Eng. 39, 325--335. Google Scholar
Digital Library
- Bafna, V., Berman, P., and Fujito, T. 1999. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Disc. Mathematics 12, 289--297. Google ScholarDigital Library
- Bansal, N., Coppersmith, D., and Sviridenko, M. 2006. Improved approximation algorithms for broadcast scheduling. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, ACM, New York, 344--353. Google ScholarDigital Library
- Baptiste, P. 2000. Batching identical jobs. Math. Meth. Oper. Res. 53, 355--367.Google ScholarCross Ref
- Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., and Schieber, B. 2001a. A unified approach to approximating resource allocation and scheduling. J. ACM 48, 1069--1090. Google ScholarDigital Library
- Bar-Noy, A., Guha, S., Katz, Y., Naor, J., Schieber, B., and Shachnai, H. 2002. Throughput maximization of real-time scheduling with batching. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithm, ACM, New York, 742--751. Google ScholarDigital Library
- Bar-Noy, A., Guha, S., Naor, J., and Schieber, B. 2001b. Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31, 331--352. Google ScholarDigital Library
- Bar-Yehuda, R., and Even, S. 1985. Local ratio theorem for approximating the weighted vertex cover problem. Ann. Disc. Math. 25, 27--46.Google Scholar
- Berman, P., and DasGupta, B. 2000. Multi-phase algorithms for throughput maximization for real-time scheduling. J. Combinat. Optimizat. 4, 307--323.Google ScholarCross Ref
- Boggia, G., Camarda, P., Mazzeo, L., and Mongiello, M. 2005. Performance of batching schemes for multimedia-on-demand services. IEEE Trans. Multimed. 7, 920--931. Google ScholarDigital Library
- Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C., Tautenhahn, T., and Van de Velde, S. L. 1998. Scheduling a batching machine. J. Sched. 1, 31--54.Google ScholarCross Ref
- Chekuri, C., and Khanna, S. 2006. A ptas for the multiple knapsack problem. SIAM J. Comput. 35, 713--728. Google ScholarDigital Library
- Chuzhoy, J., Ostrovsky, R., and Rabani, Y. 2006. Approximation algorithms for the job interval selection problem and related scheduling problems. Math. Oper. Res. 31, 730--738. Google ScholarDigital Library
- Dan, A., Sitaram, D., and Shahabuddin, P. 1996. Dynamic batching policies for an on-demand video server. ACM Multimed. Syst. J. 4, 112--121. Google ScholarDigital Library
- Dobson, G., and Nambimadom, R. S. 2001. The batch loading and scheduling problem. Oper. Res. 49, 52--65. Google ScholarDigital Library
- Gailis, R., and Khuller, S. 2003. Broadcast scheduling with deadlines. Unpublished mansucript. (www.cs.umd.edu/users/samir/grant/renars.ps)Google Scholar
- Gandhi, R., Khuller, S., Parthasarathy, S., and Srinivasan, A. 2006. Dependent rounding on bipartite graphs. J. ACM 53, 324--360. Google ScholarDigital Library
- Hochbaum, D. S., and Landy, D. 1997. Scheduling semiconductor burn-in operations to minimize total flowtime. Oper. Res. 45, 874--885.Google ScholarDigital Library
- Katz, Y. 2001. Scheduling with batching and incompatible job families. M.S. dissertation, Computer Science Dept., Technion, Haifa, Israel.Google Scholar
- Lee, V. W. H., Wong, E. W. M., Ko, K.-T., and Tang, K.-S. 2005. Multimedia-on-demand systems with broadcast, batch and interactive services. IEICE Trans. Commun. E88-B, 3097--3100.Google Scholar
- Mehta, S. V., and Uzsoy, R. 1998. Minimizing total tardiness on a batch processing machine with incompatible jobs types. IIE Trans. Sched. Log. 30, 165--175.Google ScholarCross Ref
- Pereza, I. C., Fowler, J. W., and Carlyle, W. M. 2005. Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Comput. Oper. Res. 32, 327--341. Google ScholarDigital Library
- Shachnai, H., and Tamir, T. 2001. On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442--467.Google ScholarDigital Library
- Spieksma, F. C. R. 1999. On the approximability of an interval scheduling problem. J. Sched. 29, 442--467.Google Scholar
- Uzsoy, R. 1995. Scheduling batch processing machines with incompatible job families. Int. J. Prod. Res. 33, 2685--2708.Google ScholarCross Ref
Index Terms
- Throughput maximization of real-time scheduling with batching
Recommendations
Batching and scheduling in a multi-machine flow shop
We study the problem of batching and scheduling n jobs in a flow shop comprising m , m 2, machines. Each job has to be processed on machines 1, , m in this order. Batches are formed on each machine. A machine dependent setup time precedes the ...
Single machine batch scheduling problem with family setup times and release dates to minimize makespan
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an $$O(n (\frac{n}{m}+1)^m)$$ time dynamic programming algorithm and an $$O(mk^{k}P^{2k-1})$$ time dynamic ...
Scheduling a single server in a two-machine flow shop
We study the problem of scheduling a single server that processes n jobs in a two-machine flow shop environment. A machine dependent setup time is needed whenever the server switches from one machine to the other. The problem with a given job sequence ...
Comments