Improved results for data migration and open shop scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 658-669

  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

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL STORAGE; LINEAR PROGRAMMING; SCHEDULING; VIRTUAL STORAGE;

LINEAR PROGRAMMING RELAXATION; LINEAR PROGRAMS; OPEN SHOP SCHEDULING; OPEN SHOP SCHEDULING PROBLEM; OPEN-SHOP PROBLEM; PERFORMANCE GUARANTEES; SCHEDULING PROBLEM; SUM OF COMPLETION TIME;

APPROXIMATION ALGORITHMS;

EID: 30044441057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_56     Document Type: Article

References (20)

1. E. Anderson, J. Hall, J. Hartline, M. Hobbes, et al. An Experimental Study of Data Migration Algorithms. In WAE, 145-158, 2001.
2. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, T. Tamir. On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. 140:183-202, 1998.
3. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. Wiley, 1998.
4. S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, J. Wein. Improved Scheduling Problems For Minsum Criteria. 23rd ICALP, LNCS 1099, 646-657, 1996.
5. E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. LaPaugh. Scheduling File Transfers. SIAM Journal on Computing, 14(3):744-780, 1985.
6. R. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
7. H. Gabow and O. Kariv. Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal of Computing, 11(1), February 1992.
8. J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes. On Algorithms for Efficient Data Migration. In 12th SODA, 620-629, 2001.
9. L. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Mathematics of Operations Research, 22:513-544, 1997.
10. M. M. Halldorsson, G. Kortsarz, and H. Shachnai. Sum Coloring Interval Graphs and k-Claw Free Graphs with Applications for Scheduling Dependent Jobs. Algorithmica, 37:187-209, 2003.
11. H. Hoogeveen, P. Schuurman, and G. Woeginger. Non-approximability Results For Scheduling Problems with Minsum Criteria. In 6th IPCO, LNCS 1412, 353-366, 1998.
12. S. Khuller, Y. Kim, and Y. C. Wan. Algorithms for Data Migration with Cloning. In 22nd PODS, 27-36, 2003.
13. Y. Kim. Data Migration to Minimize the Average Completion Time. In 14th SODA, 97-98, 2003.
14. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Kan, and D. B. Shmoys. Sequencing and Scheduling: Algorithms and Complexity. In S. C. Graves et al, eds., Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, 445-522, 1993.
15. T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics, 3(3):391-410, 1990.
16. M. Queyranne. Structure of a Simple Scheduling Polyhedron. Mathematical Programming, 58:263-285, 1993.
17. M. Queyranne and M. Sviridenko. A (2+∈)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. Journal of Algorithms, 45:202-212, 2002.
18. M. Queyranne and M. Sviridenko. Approximation Algorithms for Shop Scheduling Problems with Minsum Objective. Journal of Scheduling, 5:287-305, 2002.
19. A. S. Schulz. Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-based Heuristics and Lower Bounds. In 5th IPCO, LNCS 1084, 301-315, 1996.
20. L. Wolsey. Mixed Integer Programming Formulations for Production Planning and Scheduling Problems. Invited talk at the 12th International Symposium on Mathematical Programming, MIT, Cambridge, 1985.