Thumbnail Image
🆕 Date Issued:
1997
🗄 Date Available:2021-12-17
Research Paper

Please use this identifier to cite or link to this item:

Random-Based Scheduling: New Approximations and LP Lower Bounds

Schulz, Andreas S.; Skutella, Martin

Inst. Mathematik

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.
schedulingapproximationsLP lower boundsreal-world machine schedulingperformance optimization
In Copyright
Full item page