Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14471
For citation please use:
Main Title: Increasing speed scheduling and Flow scheduling
Author(s): Stiller, Sebastian
Wiese, Andreas
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15698
http://dx.doi.org/10.14279/depositonce-14471
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Network flows and scheduling have been studied intensely, but separately. In many applications a joint optimization model for routing and scheduling is desireable. Therefore, we study flows over time with a demand split into jobs. The objective is to minimize the weighted sum of completion times of these jobs. This is closely related to preemptive scheduling on a single machine with a processing speed increasing over time. For both, flow scheduling and increasing speed scheduling, we provide an EPTAS. Without release dates we can proof a tight approximation factor of (sqrt{3}+1)/2 for Smith's rule, by fully characterizing the worst case instances. We give exact algorithms for some special cases and a dynamic program for speed functions with a constant number of speeds. We can proof a competitive ratio of 2 for the online version. We also study the class of blind algorithms, i.e., those which schedule without knowledge of the speed function. For both online, and blind algorithm we provide a lower bound.
Subject(s): dynamic flows
earliest arrival flows
scheduling with varying speed
weighted sum of completion times
approximation algorithms
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, 07
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-007-2010.pdf
Format: Adobe PDF | Size: 465.14 kB
DownloadShow Preview
Thumbnail

Item Export Bar

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