Möhring, Rolf H.Schäffter, Markus W.2021-12-172021-12-1719982197-8085https://depositonce.tu-berlin.de/handle/11303/15738http://dx.doi.org/10.14279/depositonce-14511We 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.en510 Mathematikschedulingcommunication delaysseries-parallel orderapproximation algorithmResearch Paper