Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14309
For citation please use:
Main Title: Stochastic Online Scheduling on Parallel Machines
Author(s): Megow, Nicole
Uetz, Marc
Vredeveld, Tjark
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15536
http://dx.doi.org/10.14279/depositonce-14309
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic model where jobs with their processing time distributions are known beforehand, we assume that jobs appear one by one, and every job must be assigned to a machine online. We propose a simple online scheduling policy for that model, and prove a performance guarantee that matches the currently best known performance guarantee for stochastic parallel machine scheduling. For the more general model with job release dates we derive an analogous result, and for NBUE distributed processing times we even improve upon the previously best known performance guarantee for stochastic parallel machine scheduling. Moreover, we derive some lower bounds on approximation.
Subject(s): stochastic scheduling
online scheduling
parallel machines
average completion time
Issue Date: 2004
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: 2004, 18
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-018-2004.pdf
Format: Adobe PDF | Size: 163.35 kB
DownloadShow Preview
Thumbnail
Report-018-2004.ps.gz
Format: Unknown | Size: 128.01 kB
Download

Item Export Bar

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