Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria

DOI10.1007/3-540-63397-9_32zbMath1479.90111OpenAlexW1544188233MaRDI QIDQ826114

Andreas S. Schulz

Publication date: 20 December 2021

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15483

zbMATH Keywords

approximation algorithmparallel machinecompletion timescheduling problemperformance guarantee

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Approximation algorithms (68W25)

Related Items (7)

Online scheduling to minimize the total weighted completion time plus the rejection cost ⋮ A survey on offline scheduling with rejection ⋮ A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates ⋮ Scheduling projects with labor constraints ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems ⋮ Scheduling fully parallel jobs ⋮ A 1. 47-approximation for a preemptive single-machine scheduling problem

This page was built for publication: Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria