Tight Approximation Algorithms for Scheduling with Fixed Jobs and Nonavailability

Diedrich, F., Jansen, Klaus, Pradel, L., Schwarz, U. M. and Svensson, O. (2012) Tight Approximation Algorithms for Scheduling with Fixed Jobs and Nonavailability Acm Transactions on Algorithms, 8 (3).

Full text not available from this repository.


We study two closely related problems in nonpreemptive scheduling of jobs on identical parallel machines. In these two settings there are either fixed jobs or nonavailability intervals during which the machines are not available; in both cases, the objective is to minimize the makespan. Both formulations have different applications, for example, in turnaround scheduling or overlay computing. For both problems we contribute approximation algorithms with an improved ratio of 3/2. For scheduling with fixed jobs, a lower bound of 3/2 on the approximation ratio has been obtained by Scharbrodt et al. [1999]; for scheduling with nonavailability we provide the same lower bound. We use dual approximation, creation of a gap structure, and a PTAS for the multiple subset sum problem, combined with a postprocessing step to assign large jobs.

Document Type: Article
Additional Information: Univ Kiel, Inst Informat, D-24098 Kiel, Germany. EPFL Lausanne, Sch Comp & Commun Sci, Lausanne, Switzerland. Jansen, K (reprint author), Univ Kiel, Inst Informat, Christian Albrechts Pl 4, D-24098 Kiel, Germany. kj@informatik.uni-kiel.de
Keywords: Approximation optimization scheduling multiple knapsack-problem machine available time parallel machines makespan minimization subset sum scheme
Research affiliation: OceanRep > The Future Ocean - Cluster of Excellence
ISSN: 1549-6325
Projects: Future Ocean
Date Deposited: 14 May 2014 10:16
Last Modified: 14 May 2014 10:16
URI: http://eprints.uni-kiel.de/id/eprint/23895

Actions (login required)

View Item View Item