Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14466
For citation please use:
Main Title: A Robust PTAS for Machine Covering and Packing
Author(s): Skutella, Martin
Verschae, Jos
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15693
http://dx.doi.org/10.14279/depositonce-14466
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Scheduling a set of n jobs on m identical parallel machines so as to minimize the makespan or maximize the minimum machine load are two of the most important and fundamental scheduling problems studied in the literature. We consider the general online scenario where jobs are consecutively added to and/or deleted from an instance. The goal is to always maintain a (close to) optimal assignment of the current set of jobs to the m machines. This goal is essentially doomed to failure unless, upon arrival or departure of a job, we allow to reassign some other jobs. Considering that the reassignment of a job induces a cost proportional to its size, the total cost for reassigning jobs must preferably be bounded by a constant r times the total size of added or deleted jobs.
Subject(s): scheduling
approximation
online
reassignment costs
robustness
ILP in constant dimension
Issue Date: 2010
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2010, 11
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-011-2010.pdf
Format: Adobe PDF | Size: 287.12 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.