Improved results for data migration and open shop scheduling

ACM Transactions on Algorithms

Volumn 2, Issue 1, 2006, Pages 116-129

  Gandhi, Rajiv ^a   Halldórsson, Magnús M ^b   Kortsarz, Guy ^a   Shachnai, Hadas ^c  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF ICELAND   (Iceland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Data migration; Linear programming; LP rounding; Open shop; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; DATA TRANSFER; GRAPH THEORY; LINEAR PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; DATA MIGRATION; LP ROUNDING; OPEN SHOP; PROCESSING TIME;

SCHEDULING;

EID: 33745255065     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1125994.1126001     Document Type: Article

References (24)

1. ANDERSON, E., HALL, J., HARTLINE, J., HOBBES, M., KARLIN, A., SAIA, J., SWAMINATHAN, R., AND WILKES, J. 2001. An experimental study of data migration algorithms. In Proceedings of the Workshop on Algorithm Engineering. Springer-Verlag, New York, 145-158.
2. 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.
3. BRUCKER, P. 2001. Scheduling Algorithms. Springer-Verlag, New York.
4. CHAKRABARTI, S., PHILLIPS, C. A., SCHULZ, A. S., SHMOYS, D. B., STEIN, C., AND WEIN, J. 1996. Improved scheduling problems tbrminsum criteria. In Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming, Springer-Verlag, New York, 646-657.
5. CHEKURI, C., MOTWANI, R., NATARAJAN, B., AND STEIN, C. 2000. Approximation techniques for average completion time scheduling. SIAM J. Comput. 31, 1, 146-166.
6. COFFMAN, E. G., GAREY, M. R., JOHNSON, D. S., AND LAPAUGH, A. S. 1985. Scheduling file transfers. SIAM J. Comput. 14, 3, 744-780.
7. COOK, W. J., CUNNINGHAM, W. H., PULLEYBLANK, W. R., AND SCHRIJVER, A. 1998. Combinatorial Optimization. J Wiley, New York.
8. GABOW, H., AND KARIV, O. 1982. Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11, 1, 117-129.
9. GRAHAM, R. 1966. Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563-1581.
10. HALL, J., HARTLINE, J., KARLIN, A., SAIA, J., AND WILKES, J. 2001. On algorithms for efficient data migration. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 620-629.
11. 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.
12. HALLDÓRSSON, M. M., KORTSARZ, G., AND SHACHNAI, H. 2003. Sum coloring interval graphs and k-claw free graphs with applications for scheduling dependent jobs. Algorithmica 37, 187-209.
13. HOOGEVEEN, H., SCHUURMAN, P., AND WOEGINGER, G. 1998. Non-approximability results for scheduling problems with minsum criteria. In Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag, New York, 353-366.
14. KHULLER, S., KIM, Y., AND WAN, Y. C. 2004. Algorithms for data migration with cloning. SIAM J. Comput. 33, 2, 448-461.
15. KIM, Y. 2005. Data migration to minimize the average completion time. J. Alg. 55, 42-57.
16. LAWLER, E. L., LENSTRA, J. K., RINNOOY-KAN, A. H. G., AND SHMOYS, D. B. 1993. Sequencing and scheduling: Algorithms and complexity. In S. C. Graves et al. Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Recovery. S. C. Graves, et al., Eds, 445-522.
17. MARX, D. 2004. Complexity results for minimum sum edge coloring, http://www.cs.bme.hu/~dmarx/papers/marx-sum-edge-hard.pdf.
18. QUEYRANNE, M. 1993. Structure of a simple scheduling polyhedron. Mathematical Programming 58, 263-285.
19. QUEYRANNE, M., AND SVIRIDENKO, M. 2002a. A (2 + ε)-approximation algorithm for generalized preemptive open shop problem with minsum objective. J. Alg. 45, 202-212.
20. QUEYRANNE, M., AND SVIRIDENKO, M. 2002b. Approximation algorithms for shop scheduling problems with minsum objective. J. Sched. 5, 287-305.
21. SANDERS, P., AND STEURER, D. 2005. An asymptotic approximation scheme for multigraph edge coloring. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 897-906.
22. 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-Verlag, New York, 301-315.
23. SKUTELLA, M., AND UETZ, M. 2005. Stochastic machine scheduling with precedence constraints. SIAM J. Comput. 34, 4, 788-802.
24. WOLSEY, L. 1985. Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the Twelfth International Symposium on Mathematical Programming. MIT, Cambridge, MA.