Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14715
For citation please use:
Main Title: Convex Quadratic Programming Relaxations for Network Scheduling Problems
Author(s): Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15942
http://dx.doi.org/10.14279/depositonce-14715
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: In network scheduling a set of jobs must be scheduled on unrelated parallel processors or machines which are connected by a network. Initially, each job is located on some machine in the network and cannot be started on another machine until sufficient time elapses to allow the job to be transmitted there. This setting has applications, e.g., in distributed multi-processor computing environments and also in operations research; it can be modeled by a standard parallel machine environment with machine-dependent release dates. We consider the objective of minimizing the total weighted completion time.
Subject(s): approximation algorithm
randomized algorithm
convex quadratic program
scheduling
Issue Date: 1999
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
68Q25 Analysis of algorithms and problem complexity
90B35 Scheduling theory, deterministic
68M20 Performance evaluation; queueing; scheduling
90C20 Quadratic programming
90C25 Convex programming
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1999, 629
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-629-1999.pdf
Format: Adobe PDF | Size: 193.18 kB
DownloadShow Preview
Thumbnail
Report-629-1999.ps.gz
Format: Unknown | Size: 75.2 kB
Download

Item Export Bar

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