Performance guarantees of local search for multiprocessor scheduling

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

Volumn 2081, Issue , 2001, Pages 370-382

  Schuurman, Petra ^a   Vredeveld, Tjark ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS; LOCAL SEARCH (OPTIMIZATION);

ITERATIVE IMPROVEMENTS; LOCAL OPTIMA; LOCAL SEARCH ALGORITHM; MAKESPAN MINIMIZATION; MULTI PROCESSOR SCHEDULING; PARALLEL MACHINE; PERFORMANCE GUARANTEES; WORST-CASE PERFORMANCE;

INTEGER PROGRAMMING;

EID: 84947263086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_29     Document Type: Conference Paper

References (13)

1. P. Brucker, J. Hurink, and F. Werner. Improving local search heuristics for some scheduling problems I. Discrete Applied Mathematics, 65:97-122, 1996.
2. P. Brucker, J. Hurink, and F. Werner. Improving local search heuristics for some scheduling problems II. Discrete Applied Mathematics, 72:47-69, 1997.
3. Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9:511-522, 1980.
4. U. Feige, M. Karpinski, and M. Langberg. Improved approximation of MAX-CUT on graphs of bounded degree. Technical Report 85215 CS, Institut fur Informatik, Universitat Bonn, 2000.
5. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
6. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
7. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
8. D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal ofthe ACM, 34:144-162, 1987.
9. D.S. Hochbaum and D.B. Shmoys. A polynomial approximation scheme for machine scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17:539-551, 1988.
10. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291-307, 1970.
11. M R. Korupolu, C.G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Technical Report 98-30, DIMACS, 1998.
12. J.K. Lenstra, D.B. Shmoys, and EE. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990.
13. S. Lin and B.W. Kernighan. An effective heuristic for the traveling salesman problem. Operations Research, 21:489-516, 1973.