Minimizing Average Completion of Dedicated Tasks and Interval Graphs
Scheduling dependent jobs on multiple machines is modeled as a graph (multi)coloring problem. The focus of this work is on the sum of completion times measure. This is known as the sum (multi)coloring of the conflict graph. We also initiate the study of the waiting time and the robust throughput of colorings. For uniform-length tasks we give an algorithm which simultaneously approximates these two measures, as well as sum coloring and the chromatic number, within constant factor, for any graph in which the k-colorable subgraph problem is polynomially solvable. In particular, this improves the best approximation ratio known for sum coloring interval graphs from 2 to 1.665.
We then consider the problem of scheduling non-preemptively tasks (of non-uniform lengths) that require exclusive use of dedicated processors. The objective is to minimize the sum of completion times. We obtain the first constant factor approximations for this problem, when each task uses a constant number of processors.
KeywordsCompletion Time Chromatic Number Interval Graph Chordal Graph Average Completion
Unable to display preview. Download preview PDF.
- AB+00.F. Afrati, E. Bampis, A. Fishkin, K. Jansen, and C. Kenyon. Scheduling to minimize the average completion time of dedicated tasks. In FSTTCS 2000, LNCS, Delhi.Google Scholar
- BHK.A. Bar-Noy, M. M. Halldórsson, G. Kortsarz. Tight Bound for the Sum of a Greedy Coloring. Information Processing Letters, 1999.Google Scholar
- BHK+99.A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, H. Shachnai, and R. Salman. Sum Multicoloring of Graphs. Journal of Algorithms, 37(2):422–450, November 2000.Google Scholar
- G01.M. Gonen, Coloring Problems on Interval Graphs and Trees. M.Sc. Thesis. School of Computer Science, The Open Univ., Israel, 2001.Google Scholar
- HK99.M. M. Halldórsson and G. Kortsarz. Multicoloring Planar Graphs and Partial k-trees. In Proceedings of the Second International Workshop on Approximation algorithms (APPROX’ 99). Lecture Notes in Computer Science Vol. 1671, Springer-Verlag, August 1999.Google Scholar
- HK+99.M. M. Halldórsson, G. Kortsarz, A. Proskurowski, R. Salman, H. Shachnai, and J. A. Telle. Multi-Coloring Trees. In Proceedings of the Fifth International Computing and Combinatorics Conference (COCOON), Tokyo, Japan, Lecture Notes in Computer Science Vol. 1627, Springer-Verlag, July 1999.Google Scholar
- J97.K. Jansen. The Optimum Cost Chromatic Partition Problem. Proc. of the Third Italian Conference on Algorithms and Complexity (CIAC’ 97). LNCS 1203, 1997.Google Scholar
- K89.E. Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989.Google Scholar
- W97.G. Woeginger. Private communication, 1997.Google Scholar