Semidefinite and linear programming integrality gaps for scheduling identical machines

Kurpisz, Adam; Mastrolilli, Monaldo; Mathieu, Claire; Mömke, Tobias; Verdugo, Victor; Wiese, Andreas

doi:10.1007/s10107-017-1152-5

Cited by 8 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proof. The example is almost similar to the example in [24] which was used to show integrality gap examples for strong LP relaxations for identical machines makespan minimization problem. We just sketch a proof here.…”

Section: Max-min Allocation Problems and Supply Polyhedramentioning

confidence: 89%

The Heterogeneous Capacitated k-Center Problem

Chakrabarty

Krishnaswamy

Kumar

2017

Integer Programming and Combinatorial Optimization

View full text Add to dashboard Cite

In this paper we initiate the study of the heterogeneous capacitated k-center problem: given a metric space X = (F ∪ C, d), and a collection of capacities. The goal is to open each capacity at a unique facility location in F , and also to assign clients to facilities so that the number of clients assigned to any facility is at most the capacity installed; the objective is then to minimize the maximum distance between a client and its assigned facility. If all the capacities ci's are identical, the problem becomes the well-studied uniform capacitated k-center problem for which constant-factor approximations are known [8,23]. The additional choice of determining which capacity should be installed in which location makes our problem considerably different from this problem, as well the non-uniform generalizations studied thus far in literature. In fact, one of our contributions is in relating the heterogeneous problem to special-cases of the classical santa-claus problem. Using this connection, and by designing new algorithms for these special cases, we get the following results for Heterogeneous Cap-k-Center.• A quasi-polynomial time O(log n/ε)-approximation where every capacity is violated by 1 + ε.• A polynomial time O(1)-approximation where every capacity is violated by an O(log n) factor. We get improved results for the soft-capacities version where we can place multiple facilities in the same location.

show abstract

Section: Max-min Allocation Problems and Supply Polyhedramentioning

confidence: 89%

The Heterogeneous Capacitated k-Center Problem

Chakrabarty

Krishnaswamy

Kumar

2017

Integer Programming and Combinatorial Optimization

View full text Add to dashboard Cite

show abstract

“…This shows a natural limitation to the power of hierarchies as one-fit-all techniques. Quite remarkably, the instances used for obtaining lower bounds often have a very symmetric structure [43,21,56,40,58], which suggests a strong connection between the tightness of the relaxation given by these hierarchies and symmetries. The main purpose of this article is to study this connection for a specific relevant problem, namely, minimum makespan scheduling on identical machines.…”

Section: Introductionmentioning

confidence: 99%

“…The stronger configuration linear program, uses an exponential number of variables y iC which indicate whether the set of jobs assigned to i has C as a multiset of processing times. Kurpisz et al [40] showed that the configuration linear program has an integrality gap of at least 1024/1023 ≈ 1.0009 even after a linear number of rounds of the LS + or SA hierarchies. Hence, the same lower bound holds when the ground formulation is the assignment linear program.…”

Section: Introductionmentioning

confidence: 99%

“…Hence, the same lower bound holds when the ground formulation is the assignment linear program. On the other hand, Kurpisz et al [40] leave open whether the SoS hierarchy applied to the configuration linear program has a (1 + ε) integrality gap after O ε (1) many rounds. Our first main contribution is a negative answer to this question.…”

Section: Introductionmentioning

confidence: 99%

“…Letting n p denote the number of jobs in J with processing time p, we can write the following binary linear program, clp(T ), Hard instances. We briefly describe the construction of a family of hard instances {I k } k∈N for the configuration linear program in[40]. Let T = 1023, and for each odd k ∈ N we have n = 15k jobs and 3k machines.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling

Verdugo

Verschae

2019

Integer Programming and Combinatorial Optimization

Self Cite

View full text Add to dashboard Cite

The Sum of Squares (SoS) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for which a constant number of rounds of the hierarchy give integrality gaps matching the best known approximation algorithm. In many other, however, ad-hoc techniques give significantly better approximation ratios. Notably, the lower bounds instances, in many cases, are invariant under the action of a large permutation group. The main purpose of this paper is to study how the presence of symmetries on a formulation degrades the performance of the relaxation obtained by the SoS hierarchy. We do so for the special case of the minimum makespan problem on identical machines. Our first result is to show that a linear number of rounds of SoS applied over the configuration linear program yields an integrality gap of at least 1.0009. This improves on the recent work by Kurpisz et al. [40] that shows an analogous result for the weaker LS + and SA hierarchies. Then, we consider the weaker assignment linear program and add a well chosen set of symmetry breaking inequalities that removes a subset of the machine permutation symmetries. We show that applying the SoS hierarchy for O ε (1) rounds to this linear program reduces the integrality gap to (1 + ε). Our results suggest that for this classical problem the symmetries of the natural assignment linear program were the main barrier preventing the SoS hierarchy to give relaxations with integrality gap (1 + ε) after a constant number of rounds. We leave as an open question whether this phenomenon occurs for different problems where the SoS hierarchy yields weak relaxations.

show abstract