16 research outputs found
Inapproximability Results for Scheduling with Interval and Resource Restrictions
In the restricted assignment problem, the input consists of a set of machines and a set of jobs each with a processing time and a subset of eligible machines. The goal is to find an assignment of the jobs to the machines minimizing the makespan, that is, the maximum summed up processing time any machine receives. Herein, jobs should only be assigned to those machines on which they are eligible. It is well-known that there is no polynomial time approximation algorithm with an approximation guarantee of less than 1.5 for the restricted assignment problem unless P=NP. In this work, we show hardness results for variants of the restricted assignment problem with particular types of restrictions.
For the case of interval restrictions - where the machines can be totally ordered such that jobs are eligible on consecutive machines - we show that there is no polynomial time approximation scheme (PTAS) unless P=NP. The question of whether a PTAS for this variant exists was stated as an open problem before, and PTAS results for special cases of this variant are known.
Furthermore, we consider a variant with resource restriction where the sets of eligible machines are of the following form: There is a fixed number of (renewable) resources, each machine has a capacity, and each job a demand for each resource. A job is eligible on a machine if its demand is at most as big as the capacity of the machine for each resource. For one resource, this problem has been intensively studied under several different names and is known to admit a PTAS, and for two resources the variant with interval restrictions is contained as a special case. Moreover, the version with multiple resources is closely related to makespan minimization on parallel machines with a low rank processing time matrix. We show that there is no polynomial time approximation algorithm with a rate smaller than 48/47 ? 1.02 or 1.5 for scheduling with resource restrictions with 2 or 4 resources, respectively, unless P=NP. All our results can be extended to the so called Santa Claus variants of the problems where the goal is to maximize the minimal processing time any machine receives
Online Load Balancing on Uniform Machines with Limited Migration
In the problem of online load balancing on uniformly related machines with
bounded migration, jobs arrive online one after another and have to be
immediately placed on one of a given set of machines without knowledge about
jobs that may arrive later on. Each job has a size and each machine has a
speed, and the load due to a job assigned to a machine is obtained by dividing
the first value by the second. The goal is to minimize the maximum overall load
any machine receives. However, unlike in the pure online case, each time a new
job arrives it contributes a migration potential equal to the product of its
size and a certain migration factor. This potential can be spend to reassign
jobs either right away (non-amortized case) or at any later time (amortized
case). Semi-online models of this flavor have been studied intensively for
several fundamental problems, e.g., load balancing on identical machines and
bin packing, but uniformly related machines have not been considered up to now.
In the present paper, the classical doubling strategy on uniformly related
machines is combined with migration to achieve an
-competitive algorithm and a -competitive
algorithm with amortized and non-amortized migration,
respectively, while the best known competitive ratio in the pure online setting
is roughly
Approximation Schemes for Machine Scheduling
In the classical problem of makespan minimization on identical parallel machines, or machine scheduling for short, a set of jobs has to be assigned to a set of machines. The jobs have a processing time and the goal is to minimize the latest finishing time of the jobs. Machine scheduling is well known to be NP-hard and thus there is no polynomial time algorithm for this problem that is guaranteed to find an optimal solution unless P=NP. There is, however, a polynomial time approximation scheme (PTAS) for machine scheduling, that is, a family of approximation algorithms with ratios arbitrarily close to one. Whether a problem admits an approximation scheme or not is a fundamental question in approximation theory. In the present work, we consider this question for several variants of machine scheduling.
We study the problem where the machines are partitioned into a constant number of types and the processing time of the jobs is also dependent on the machine type.
We present so called efficient PTAS (EPTAS) results for this problem and variants thereof.
We show that certain cases of machine scheduling with assignment restrictions do not admit a PTAS unless P=NP. Moreover, we introduce a graph framework based on the restrictions of the jobs and use it in the design of approximation schemes for other variants.
We introduce an enhanced integer programming formulation for assignment problems, show that it can be efficiently solved, and use it in the EPTAS design for variants of machine scheduling with setup times. For one of the problems, we show that there is also a PTAS in the case with uniform machines, where machines have speeds influencing the processing times of the jobs.
We consider cases in which each job requires a certain amount of a shared renewable resource and the processing time is depended on the amount of resource it receives or not. We present so called asymptotic fully polynomial time approximation schemes (AFPTAS) for the problems
Estimating The Makespan of The Two-Valued Restricted Assignment Problem
We consider a special case of the scheduling problem on unrelated machines,namely the Restricted Assignment Problem with two different processing times.We show that the configuration LP has an integrality gap of at most~ for this problem. This allows us to estimate the optimal makespan within a factor of~,improving upon the previously best known estimation algorithm with ratio~\frac{11}{6} \approx \numprint{1.833} due to Chakrabarty, Khanna, and Li \cite{CKL15}
Online Bin Covering with Limited Migration
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years.
This is motivated by the fact that the pure online model is often too restrictive to model real-world applications, where some changes might be allowed. A well-studied measure of the amount of decisions that can be revoked is the migration factor beta: When an object o of size s(o) arrives, the decisions for objects of total size at most beta * s(o) may be revoked. Usually beta should be a constant. This means that a small object only leads to small changes. This measure has been successfully investigated for different, classical problems such as bin packing or makespan minimization. The dual of makespan minimization - the Santa Claus or machine covering problem - has also been studied, whereas the dual of bin packing - the bin covering problem - has not been looked at from such a perspective.
In this work, we extensively study the bin covering problem with migration in different scenarios. We develop algorithms both for the static case - where only insertions are allowed - and for the dynamic case, where items may also depart. We also develop lower bounds for these scenarios both for amortized migration and for worst-case migration showing that our algorithms have nearly optimal migration factor and asymptotic competitive ratio (up to an arbitrary small epsilon). We therefore resolve the competitiveness of the bin covering problem with migration
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
We consider variants of the restricted assignment problem where a set of jobs has to be assigned to a set of machines, for each job a size and a set of eligible machines is given, and the jobs may only be assigned to eligible machines with the goal of makespan minimization. For the variant with interval restrictions, where the machines can be arranged on a path such that each job is eligible on a subpath, we present the first better than 2-approximation and an improved inapproximability result. In particular, we give a (2-1/24)-approximation and show that no better than 9/8-approximation is possible, unless P=NP. Furthermore, we consider restricted assignment with R resource restrictions and rank D unrelated scheduling. In the former problem, a machine may process a job if it can meet its resource requirements regarding R (renewable) resources. In the latter, the size of a job is dependent on the machine it is assigned to and the corresponding processing time matrix has rank at most D. The problem with interval restrictions includes the 1 resource variant, is encompassed by the 2 resource variant, and regarding approximation the R resource variant is essentially a special case of the rank R+1 problem. We show that no better than 3/2, 8/7, and 3/2-approximation is possible (unless P=NP) for the 3 resource, 2 resource, and rank 3 variant, respectively. Both the approximation result for the interval case and the inapproximability result for the rank 3 variant are solutions to open challenges stated in previous works. Lastly, we also consider the reverse objective, that is, maximizing the minimal load any machine receives, and achieve similar results
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
This paper considers parallel machine scheduling with incompatibilities
between jobs. The jobs form a graph and no two jobs connected by an edge are
allowed to be assigned to the same machine. In particular, we study the case
where the graph is a collection of disjoint cliques. Scheduling with
incompatibilities between jobs represents a well-established line of research
in scheduling theory and the case of disjoint cliques has received increasing
attention in recent years. While the research up to this point has been focused
on the makespan objective, we broaden the scope and study the classical total
completion time criterion. In the setting without incompatibilities, this
objective is well known to admit polynomial time algorithms even for unrelated
machines via matching techniques. We show that the introduction of
incompatibility cliques results in a richer, more interesting picture.
Scheduling on identical machines remains solvable in polynomial time, while
scheduling on unrelated machines becomes APX-hard. Furthermore, we study the
problem under the paradigm of fixed-parameter tractable algorithms (FPT). In
particular, we consider a problem variant with assignment restrictions for the
cliques rather than the jobs. We prove that it is NP-hard and can be solved in
FPT time with respect to the number of cliques. Moreover, we show that the
problem on unrelated machines can be solved in FPT time for reasonable
parameters, e.g., the parameter pair: number of machines and maximum processing
time. The latter result is a natural extension of known results for the case
without incompatibilities and can even be extended to the case of total
weighted completion time. All of the FPT results make use of n-fold Integer
Programs that recently have received great attention by proving their
usefulness for scheduling problems
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times
Integer linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems, where a set of items has to be placed in multiple target locations. Herein a configuration describes a possible placement on one of the target locations, and the IP is used to chose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of n-fold integer programming and therefore be solved efficiently. As an application, we consider scheduling problems with setup times, in which a set of jobs has to be scheduled on a set of identical machines, with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time f(1/epsilon) x poly(|I|) with a single exponential term in f for the first and a double exponential one for the second case. Previously, only constant factor approximations of 5/3 and 4/3 + epsilon respectively were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine