Performance Guarantees of Local Search for Multiprocessor Scheduling

Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum.

[1]  Esther M. Arkin,et al.  On Local Search for Weighted k-Set Packing , 1998, Math. Oper. Res..

[2]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[3]  Giorgio Ausiello,et al.  Local Search, Reducibility and Approximability of NP-Optimization Problems , 1995, Inf. Process. Lett..

[4]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[5]  Dushyant Sharma,et al.  Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem , 2001, Math. Program..

[6]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[7]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

[8]  Maria Grazia Scutellà,et al.  A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

[9]  Petra Schuurman,et al.  Performance Guarantees of Local Search for Multiprocessor Scheduling , 2001, INFORMS J. Comput..

[10]  Tjark Vredeveld,et al.  Local search for multiprocessor scheduling: how many moves does it take to a local optimum? , 2003, Oper. Res. Lett..

[11]  Peter Brucker,et al.  Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..

[12]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  Éva Tardos,et al.  A constant factor approximation algorithm for a class of classification problems , 2000, STOC '00.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Olga Veksler,et al.  A New Algorithm for Energy Minimization with Discontinuities , 1999, EMMCVPR.

[16]  Marek Karpinski,et al.  Improved approximation of Max-Cut on graphs of bounded degree , 2002, J. Algorithms.

[17]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[18]  Gerhard J. Woeginger,et al.  Local search for the minimum label spanning tree problem with bounded color classes , 2003, Oper. Res. Lett..

[19]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1986, FSTTCS.

[20]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.

[21]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[22]  Dushyant Sharma,et al.  New neighborhood search structures for the capacitated minimum spanning tree problem , 1998 .

[23]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[24]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[25]  David P. Williamson,et al.  Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.

[26]  Ellis Horowitz,et al.  A linear time approximation algorithm for multiprocessor scheduling , 1979 .

[27]  Jan Karel Lenstra,et al.  On local search for the generalized graph coloring problem , 2003, Oper. Res. Lett..

[28]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[29]  Sartaj Sahni,et al.  Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..

[30]  Peter Brucker,et al.  Improving Local Search Heuristics for Some Scheduling Problems-I , 1996, Discret. Appl. Math..

[31]  Éva Tardos,et al.  Facility location with nonuniform hard capacities , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[32]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[33]  R. Ravi,et al.  Approximation algorithms for the test cover problem , 2003, Math. Program..

[34]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..