Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
From MaRDI portal
Publication:826114
DOI10.1007/3-540-63397-9_32zbMath1479.90111MaRDI QIDQ826114
Andreas S. Schulz, Martin Skutella
Publication date: 20 December 2021
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15483
approximation algorithm; parallel machine; completion time; scheduling problem; performance guarantee
Related Items
Scheduling projects with labor constraints, A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, A 1. 47-approximation for a preemptive single-machine scheduling problem, On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems