Universal Sequencing on an Unreliable Machine

DOI10.1137/110844210zbMath1252.68047OpenAlexW2159036178WikidataQ57399764 ScholiaQ57399764MaRDI QIDQ2910853

Julián Mestre, Nicole Megow, Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Leen Stougie

Publication date: 12 September 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/ws/files/3067170/287206.pdf

zbMATH Keywords

schedulingsingle machineunreliable machinemin-sum objectiveuniversal solutionmachine speedworst case guarantee

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (11)

Packing a Knapsack of Unknown Capacity ⋮ Dual Techniques for Scheduling on a Machine with Varying Speed ⋮ Optimal Algorithms and a PTAS for Cost-Aware Scheduling ⋮ Speed-robust scheduling: sand, bricks, and rocks ⋮ Minimizing worst-case and average-case makespan over scenarios ⋮ Distributionally robust appointment scheduling with moment-based ambiguity set ⋮ The TV advertisements scheduling problem ⋮ Optimal algorithms for scheduling under time-of-use tariffs ⋮ Speed-robust scheduling. Sand, bricks, and rocks ⋮ Submodular Maximization with Uncertain Knapsack Capacity ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

This page was built for publication: Universal Sequencing on an Unreliable Machine