Improved bounds for scheduling conflicting jobs with minsum criteria

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Gandhi, Rajiv ^a,d   Halldórsson, Magns M ^b,e   Kortsarz, Guy ^a,d   Shachnai, Hadas ^c  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF ICELAND   (Iceland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d RUTGERS UNIVERSITY   (United States)

^e REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

Approximation algorithms; Coloring; Linear programming; LP rounding; Scheduling; Sum multicoloring

Indexed keywords

LP ROUNDING; SUM MULTICOLORING;

APPROXIMATION ALGORITHMS; COLORING; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

SCHEDULING;

EID: 42149083933     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328922     Document Type: Article

References (37)

1. AFRATI, F., BAMPIS, E., FISHKIN, A., JANSEN, K., AND KENYON, C. 2000. Scheduling to minimize the average completion time of dedicated tasks. In Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science. Springer, 454-464.
2. BAR-NOY, A., AND KORTSARZ, G. 1998. The minimum color-sum of bipartite graphs. J. Algor. 28, 339-365.
3. BAR-NOY, A., HALLDÓRSSON, M. M., KORTSARZ, G., SHACHNAI, H., AND TAMIR, T. 2000. Sum multi-coloring of graphs. J. Algor. 37, 422-450.
4. BAR-NOY, A., BELLARE, M., HALLDÓ RSSON, M. M., SHACHNAI, H., AND TAMIR, T. 1998. On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183-202.
5. BELL, M. 1992. Future directions in traffic signal control. Transport. Res. Part A 26, 303-313.
6. BODLAENDER, H. L., AND FOMIN, F. V. 2004. Equitable colorings of bounded treewidth graphs. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. Springer, 180-190.
7. BULLOCK, D., AND HENDRICKSON, C. 1994. Roadway traffic control software. IEEE Trans. Control Syst. Technol. 2, 255-264.
8. CHAKRABARTI, S., PHILLIPS, C. A., SCHULZ, A. S., SHMOYS, D. B., STEIN, C., AND WEIN, J. 1996. Improved scheduling problems for minsum. criteria. In Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP). Springer, 646-657.
9. CHEN, J., CIDON, I., AND OFEK, Y. 1993. A local fairness algorithm for gigabit lans/mans with spatial reuse. IEEE J. Select. Areas Commun. 11, 1183-1192.
10. COFFMAN, E. G., GAREY, M. R., JOHNSON, D. S., AND LAPAUGH, A. S. 1985. Scheduling file transfers. SIAM J. Comput. 14, 3, 744-780.
11. FEIGE, U., LOVÁSZ, L., AND TETALI, P. 2004. Approximating min-sum set cover. Algorithmica 40, 4, 219-234.
12. GANDHI, R., HALLDÓRSSON, M. M., KORTSARZ, G., AND SHACHNAI, H. 2006. Improved results for data migration and openshop scheduling. ACM Trans. Algor. 2, 1, 116-129.
13. GERGOV, J. 1999. Algorithms for compile-time memory allocation. In Proceedings of the 10 ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 907-908.
14. GIARO, K., MALAFIEJSKI, M., KUBALE, M., AND PIWAKOWSKI, K. 2002. Dedicated scheduling of biprocessor tasks to minimize mean flow times. In Proceedings of the 4th International Conference on Parallel Processing and Applied Mathematics. Springer, 87-96.
15. GONEN, M. 2001. Coloring problems on interval graphs and trees. M. Sc. Thesis, School of Computer Science, The Open University, Tel-Aviv.
16. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1993. Geometric Algorithms and Combinatorial Optimization. Springer.
17. HALL, L., SCHULZ, A. S., SHMOYS, D. B., AND WEIN, J. 1997. Scheduling to minimize average completion time: Off-Line and on-line approximation algorithms. Math. Oper. Res. 22, 513-544.
18. HALL, L., SHMOYS, D. B., AND WEIN, J. 1996. Scheduling to minimize average completion time: Off-Line and on-line approximation algorithms. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 142-151.
19. HALLDÓRSSON, M. M., AND KORTSARZ, G. 2002. Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algor. 42, 2, 334-366.
20. HALLDÓRSSON, M. M., KORTSARZ, G., PROSKUROWSKI, A., SALMAN, R., SHACHNAI, H., AND TELLE, J. A. 2003a. Multicoloring trees. Inf. Comput. 180, 2, 113-129.
21. HALLDÓRSSON, M. M., KORTSARZ, G., AND SHACHNAI, H. 2003b. Sum coloring interval graphs and k-claw free graphs with applications for scheduling dependent jobs. Algorithmica 37, 187-209.
22. HOOGEVEEN, H., VAN DER VELDE, S. L., AND VELTMAN, B. 1994. Complexity of scheduling multi-processor tasks with prespecified processor allocations. Discr. Appl. Math. 55, 259-272.
23. KIM, Y. 2005. Data migration to minimize the average completion time. J. Algor. 55, 42-57.
24. KUBALE, M. 1996. Preemptive versus non-preemptive scheduling of biprocessor tasks on dedicated processors. Euro. J. Oper. Res. 94, 242-251.
25. KUBICKA, E. 1989. The chromatic sum of a graph. Ph.D. Thesis, Western Michigan University.
26. MALAFIEJSKI, M., GIARO, K., JANCZEWSKI, R., AND KUBALE, M. 2004. Sum coloring of bipartite graphs with bounded degree. Algorithmica 40, 4, 235-244.
27. MARX, D. 2004. Chromatic sum and minimum sum multicoloring. http://www.cs.bme.hu/dmarx/sum.html.
28. MARX, D. 2003. Minimum sum multicoloring on the edges of trees. In Proceedings of the 1st Workshop on Approximation and Online Algorithms. Springer, 214-226.
29. NICOLOSO, S., SARRAFZADEH, M., AND SONG, X. 1999. On the sum coloring problem on interval graphs. Algorithmica 23, 109-126.
30. POTTS , C. N. 1980. An algorithm for the single machine sequencing problem with precedence constraints. Math. Program. Stud. 13, 78-87.
31. QUEYRANNE, M. 1993. Structure of a simple scheduling polyhedron. Math. Program. 58, 263-285.
32. QUEYRANNE, M. 1987. Polyhedral approaches to scheduling problems. Seminar presented at Rucor, Rutgers University.
33. QUEYRANNE, M., AND SVIRIDENKO, M. 2002a. A (2 + ∈)-approximation algorithm for generalized preemptive open shop problem, with minsum objective. J. Algor. 45, 202-212.
34. QUEYRANNE, M., AND SVIRIDENKO, M. 2002b. Approximation algorithms for shop scheduling problems with minsum. objective. J. Schedul. 5, 287-305.
35. SCHULZ, A. S. 1996. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization. Springer, 301-315.
36. WOEGINGER, G. 1997. Private communication.
37. WOLSEY, L. 1985. Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the 12th International Symposium on Mathematical Programming, Cambridge, MA.