Explorable uncertainty in scheduling with non-uniform testing times

DOI10.1007/978-3-030-80879-2_9OpenAlexW3183786176MaRDI QIDQ2117694

Alexander Eckl, Susanne Albers

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2009.13316

zbMATH Keywords

single machinecompetitive analysismakespanonline schedulingsum of completion timesexplorable uncertainty

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Scheduling with testing on multiple identical parallel machines ⋮ Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing ⋮ Improved approximation algorithms for multiprocessor scheduling with testing ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Stochastic graph exploration with limited resources ⋮ Scheduling with a processing time oracle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The robust knapsack problem with queries
• Query strategies for priced information
• Efficient update strategies for geometric computing with uncertainty
• The update complexity of selection and related problems
• Computing shortest paths with uncertainty
• Optimal Search for the Best Alternative
• Computing the Median with Uncertainty
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Scheduling

This page was built for publication: Explorable uncertainty in scheduling with non-uniform testing times