Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14456
For citation please use:
Main Title: Random-Based Scheduling: New Approximations and LP Lower Bounds
Author(s): Schulz, Andreas S.
Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15683
http://dx.doi.org/10.14279/depositonce-14456
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Three characteristics encountered frequently in real-world machine scheduling are jobs released over time, precedence constraints between jobs, and average performance optimization. The general constrained one-machine scheduling problem to minimize the average weighted completion time not only captures these features, but also is an important building block for more complex problems involving multiple machines.
Subject(s): scheduling
approximations
LP lower bounds
real-world machine scheduling
performance optimization
Issue Date: 1997
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: 1997, 549
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-549-1997.pdf
Format: Adobe PDF | Size: 174.65 kB
DownloadShow Preview
Thumbnail
Report-549-1997.ps.gz
Format: Unknown | Size: 66.5 kB
Download

Item Export Bar

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