Abstract
We consider a general class of scheduling problems where a set of dependent jobs needs to be scheduled (preemptively or non-preemptively) on a set of machines so as to minimize the weighted sum of completion times. The dependencies among the jobs are formed as an arbitrary conflict graph. An input to our problems can be modeled as an instance of the sum multicoloring (SMC) problem: Given a graph and the number of colors required by each vertex, find a proper multicoloring which minimizes the sum over all vertices of the largest color assigned to each vertex. In the preemptive case (pSMC), each vertex can receive an arbitrary subset of colors; in the non-preemptive case (npSMC), the colors assigned to each vertex need to be contiguous. SMC is known to be no easier than classic graph coloring, even in the case of unit color requirements.
Building on the framework of Queyranne and Sviridenko (J. of Scheduling, 5:287-305, 2002), we present a general technique for reducing the sum multicoloring problem to classical graph multicoloring. Using the technique, we improve the best known results for pSMC and npSMC on several fundamental classes of graphs, including line graphs, (k + 1)-claw free graphs and perfect graphs. In particular, we obtain the first constant factor approximation ratio for npSMC on interval graphs, on which our problems have numerous applications. We also improve the results of Kim (SODA 2003, 97–98) for npSMC of line graphs and for resource-constrained scheduling.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afrati, F.N., Bampis, E., Fishkin, A.V., Jansen, K., Kenyon, C.: Scheduling to minimize the average completion time of dedicated tasks. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, p. 454. Springer, Heidelberg (2000)
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comp. 140, 183–202 (1998)
Bar-Noy, A., Halldórsson, M.M., Kortsarz, G., Shachnai, H., Salman, R.: Sum multicoloring of graphs. J. Algorithms 37(2), 422–450 (2000)
Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. J. Algorithms 28, 339–365 (1998)
Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 875–886. Springer, Heidelberg (1996)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14, 744–780 (1985)
Feige, U., Lovász, L., Tetali, P.: Approximating min-sum set cover. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 94–107. Springer, Heidelberg (2002)
Gergov, J.: Algorithms for compile-time memory allocation. In: SODA (1999)
Giaro, K., Janczewski, R., Kubale, M., Małafiejski, M.: A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 131–145. Springer, Heidelberg (2002)
Gonen, M.: Coloring Problems on Interval Graphs and Trees. M.Sc. thesis, The Open Univ., Tel-Aviv (2001)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria, full version, http://www.cs.technion.ac.il/~hadas/PUB/smc-waoa04.ps
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and open shop scheduling. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 658–669. Springer, Heidelberg (2004)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1993)
Hall, L.A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line algorithms. In: SODA 1996, January 1996, pp. 142–151 (1996)
Hall, L.A., Schulz, A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Operations Research 22, 513–544 (1997)
Halldórsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms 42(2), 334–366 (2002)
Halldórsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multicoloring trees. Inf. Computation 180(2), 113–129 (2003)
Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37, 187–209 (2003)
Jansen, K.: The optimum cost chromatic partition problem. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 25–36. Springer, Heidelberg (1997)
Kim, Y.A.: Data migration to minimize the average completion time. In: SODA (2003)
Kubale, M.: Preemptive versus non preemptive scheduling of biprocessor tasks on dedicated processors. European J. Operational Research 94, 242–251 (1996)
Kubicka, E.: The chromatic sum of a graph. PhD thesis, Western Michigan (1989)
Nicoloso, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23, 109–126 (1999)
Potts, C.N.: An algorithm for the single machine sequencing problem with precedence constraints. Math. Prog. Stud. 13, 78–87 (1980)
Queyranne, M.: Structure of a simple scheduling polyhedron. Math. Prog. 58, 263–285 (1993)
Queyranne, M., Sviridenko, M.: A 2 + ε-approximation algorithm for generalized preemptive open shop problem with minsum objective. J. Alg. 45, 202–212 (2002)
Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. J. Scheduling 5, 287–305 (2002)
Schulz, A.S.: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 301–315. Springer, Heidelberg (1996)
Woeginger, G.: Private communication (1997)
Wolsey, L.: Mixed Integer Programming Formulations for Production Planning and Scheduling Problems. In: Invited talk at 12th ISMP, MIT, Cambridge (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H. (2005). Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)