Scheduling Series-Parallel Orders Subject to 0/1-Communication Delays
| dc.contributor.author | Möhring, Rolf H. | |
| dc.contributor.author | Schäffter, Markus W. | |
| dc.date.accessioned | 2021-12-17T10:10:11Z | |
| dc.date.available | 2021-12-17T10:10:11Z | |
| dc.date.issued | 1998 | |
| dc.description.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. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15738 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14511 | |
| 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 | communication delays | en |
| dc.subject.other | series-parallel order | en |
| dc.subject.other | approximation algorithm | en |
| dc.title | Scheduling Series-Parallel Orders Subject to 0/1-Communication Delays | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 1998, 611 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
| tub.subject.msc2000 | 90B35 Scheduling theory, deterministic | en |