Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14511
For citation please use:
Main Title: Scheduling Series-Parallel Orders Subject to 0/1-Communication Delays
Author(s): Möhring, Rolf H.
Schäffter, Markus W.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15738
http://dx.doi.org/10.14279/depositonce-14511
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We consider the problem P}&;| prec},cij&;{0,1}|κ of scheduling jobs with arbitrary processing times on sufficiently many parallel processors subject to series-parallel precedence constraints and 0/1-communication delays in order to minimize a regular performance measure κ. Such schedules without processor restrictions are used for generating approximate solutions for a restricted number of processors.
Subject(s): scheduling
communication delays
series-parallel order
approximation algorithm
Issue Date: 1998
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
90B35 Scheduling theory, deterministic
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1998, 611
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-611-1998.pdf
Format: Adobe PDF | Size: 209.5 kB
DownloadShow Preview
Thumbnail
Report-611-1998.ps.gz
Format: Unknown | Size: 87 kB
Download

Item Export Bar

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