Increasing speed scheduling and Flow scheduling

dc.contributor.authorStiller, Sebastian
dc.contributor.authorWiese, Andreas
dc.date.accessioned2021-12-17T10:09:12Z
dc.date.available2021-12-17T10:09:12Z
dc.date.issued2010
dc.description.abstractNetwork 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.en
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15698
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14471
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherdynamic flowsen
dc.subject.otherearliest arrival flowsen
dc.subject.otherscheduling with varying speeden
dc.subject.otherweighted sum of completion timesen
dc.subject.otherapproximation algorithmsen
dc.titleIncreasing speed scheduling and Flow schedulingen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften>Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2010, 07en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
Files
Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
Report-007-2010.pdf
Size:
465.14 KB
Format:
Adobe Portable Document Format
Description:
Collections