Schulz, Andreas S.Skutella, Martin2021-12-172021-12-1719972197-8085https://depositonce.tu-berlin.de/handle/11303/15683http://dx.doi.org/10.14279/depositonce-14456Three 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.en510 MathematikschedulingapproximationsLP lower boundsreal-world machine schedulingperformance optimizationResearch Paper