Please use this identifier to cite or link to this item:
http://dx.doi.org/10.14279/depositonce-14371
For citation please use:
For citation please use:
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Megow, Nicole | |
| dc.contributor.author | Vredeveld, Tjark | |
| dc.date.accessioned | 2021-12-17T10:07:06Z | - |
| dc.date.available | 2021-12-17T10:07:06Z | - |
| dc.date.issued | 2006 | |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15598 | - |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14371 | - |
| dc.description.abstract | We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem. | en |
| 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 | scheduling | en |
| dc.subject.other | total weighted completion time | en |
| dc.subject.other | preemptive | en |
| dc.subject.other | approximation | en |
| dc.subject.other | stochastic dynamic optimization | en |
| dc.subject.other | online optimization | en |
| dc.title | Approximation Results for Preemptive Stochastic Online Scheduling | en |
| dc.type | Research Paper | en |
| tub.accessrights.dnb | free | en |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 2006, 08 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| dc.type.version | submittedVersion | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik | de |
| tub.subject.msc2000 | 90B36 Scheduling theory, stochastic | en |
| tub.subject.msc2000 | 68W40 Analysis of algorithms | en |
| tub.subject.msc2000 | 68W25 Approximation algorithms | en |
| tub.subject.msc2000 | 68M20 Performance evaluation; queueing; scheduling | en |
| Appears in Collections: | Technische Universität Berlin » Publications | |
Files in This Item:
Item Export Bar
Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.