Approximation algorithm for minimizing total latency in machine scheduling with deliveries

Discrete Optimization

Volumn 5, Issue 1, 2008, Pages 97-107

  Levin, Asaf ^a   Penn, Michal ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithm; Minimum latency; Scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; FINITE DIFFERENCE METHOD; OPTIMIZATION; PROBLEM SOLVING; VEHICLE ROUTING;

MACHINE SCHEDULING; MINIMUM LATENCY;

SCHEDULING;

EID: 38749101325     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2007.11.007     Document Type: Article

References (16)

1. A. Archer, A. Levin, D.P. Williamson, Faster approximation algorithm for the minimum latency problem, SIAM Journal on Computing (in press)
2. S. Arora, G. Karakostas, A 2 + ε{lunate} approximation algorithm for the k-MST problem, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 754-759
3. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976
4. Chudak F.A., Roughgarden T., and Williamson D.P. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Mathematical Programming Series A 100 (2004) 411-422
5. N. Garg, A 3-approximation for the minimum tree spanning k vertices, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 96, 1996, pp. 302-309
6. N. Garg, Saving an epsilon: A 2-approximation for the k-MST problem in graphs, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC 05, 2005, pp. 396-402
7. Goemans M.X., and Kleinberg J. An improved approximation ratio for the minimum latency problem. Mathematical Programming 82 (1998) 111-124
8. Goemans M.X., and Williamson D.P. A general approximation technique for constrained forest problems. SIAM Journal on Computing 24 (1995) 296-317
9. Levin A. Strongly polynomial-time approximation for a class of bicriteria problems. Operations Research Letters 32 (2004) 530-534
10. Li C.L., Vairaktarakis G., and Lee C.Y. Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research 164 (2005) 39-51
11. Megiddo N. Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4 (1979) 414-424
12. Pinedo M. Scheduling: Theory, Algorithms, and Systems. 2nd ed. (2001), Prentice Hall
13. Sahni S., and Gonzalez T. P-complete approximation problems. Journal of the ACM 23 (1976) 555-565
14. Smith W.E. Various optimizers for single-stage production. Naval Research Logistics Quarterly 3 (1956) 59-66
15. Stevenson W.J. Operations Management. 8th ed. (2005), McGraw-hill
16. D.P. Williamson, Private communication, 2004