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 choose 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/\varepsilon )\cdot \mathrm {poly}(|I|)$$
f
(
1
/
ε
)
·
poly
(
|
I
|
)
. Previously, only constant factor approximations of 5/3 and $$4/3 + \varepsilon $$
4
/
3
+
ε
, 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.
We study the well-known two-dimensional strip packing problem. Given a set of rectangular axis-parallel items and a strip of width W with infinite height, the objective is to find a packing of all items into the strip, which minimizes the packing height. Lately, it has been shown that the lower bound of 3/2 of the absolute approximation ratio can be beaten when we allow a pseudo-polynomial running-time of type (nW ) f (1/ε) . If W is polynomially bounded by the number of items, this is a polynomial running-time. The currently best pseudopolynomial approximation algorithm by Nadiradze and Wiese achieves an approximation ratio of 1.4 + ε. We present a pseudo-polynomial algorithm with improved approximation ratio 4/3 + ε. Furthermore, the presented algorithm has a significantly smaller running-time as the 1.4 + ε approximation algorithm.
We consider two related scheduling problems: single resource-constrained scheduling on identical parallel machines and a generalization with resource-dependent processing times. In both problems, jobs require a certain amount of an additional resource and have to be scheduled on machines minimizing the makespan, while at every point in time a given resource capacity is not exceeded. In the first variant of the problem, the processing times and resource amounts are fixed, while in the second the former depends on the latter.
Both problems contain bin packing with cardinality constraint as a special case, and, therefore, these problems are strongly NP-complete even for a constant number of machines larger than three, which can be proven by a reduction from 3-Partition. Furthermore, if the number of machines is part of the input, then we cannot hope for an approximation algorithm with absolute approximation ratio smaller than 3/2.
We present asymptotic fully polynomial time approximation schemes (AFPTAS) for the problems: For any ε > 0, a schedule of length at most (1+ε) times the optimum plus an additive term of
O
(
p
max
log (1/ε)/ε) is provided, and the running time is polynomially bounded in 1/ε and the input length. Up to now, only approximation algorithms with absolute approximation ratios were known. Furthermore, the AFPTAS for resource-constrained scheduling on identical parallel machines directly improves the additive term of the best AFPTAS for bin packing with cardinality constraint so far.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.