Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14333
For citation please use:
Main Title: Preemptive scheduling with rejection
Author(s): Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15560
http://dx.doi.org/10.14279/depositonce-14333
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan on the m machines plus the sum of the penalties of the jobs rejected.
Subject(s): scheduling
preemption
approximation algorithm
worst case ratio
computational complexity
in-approximability
Issue Date: 2000
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
68Q25 Analysis of algorithms and problem complexity
90B35 Scheduling theory, deterministic
68M20 Performance evaluation; queueing; scheduling
90C59 Approximation methods and heuristics
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2000, 684
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-684-2000.pdf
Format: Adobe PDF | Size: 12.94 MB
DownloadShow Preview
Thumbnail
Report-684-2000.ps.gz
Format: Unknown | Size: 89.24 kB
Download

Item Export Bar

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