Increasing speed scheduling and Flow scheduling
| dc.contributor.author | Stiller, Sebastian | |
| dc.contributor.author | Wiese, Andreas | |
| dc.date.accessioned | 2021-12-17T10:09:12Z | |
| dc.date.available | 2021-12-17T10:09:12Z | |
| dc.date.issued | 2010 | |
| dc.description.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. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15698 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14471 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | dynamic flows | en |
| dc.subject.other | earliest arrival flows | en |
| dc.subject.other | scheduling with varying speed | en |
| dc.subject.other | weighted sum of completion times | en |
| dc.subject.other | approximation algorithms | en |
| dc.title | Increasing speed scheduling and Flow scheduling | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 2010, 07 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
Files
Original bundle
1 - 1 of 1