Performance guarantees for scheduling algorithms under perturbed machine speeds

DOI10.1007/978-3-642-45030-3_20zbMATH Open1329.90058OpenAlexW1835300951MaRDI QIDQ2872085FDOQ2872085

Michael Etscheid

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_20

Recommendations

• Performance guarantees for scheduling algorithms under perturbed machine speeds
• Smoothed performance guarantees for local search
• Smoothed Performance Guarantees for Local Search
• Performance guarantees of local search for minsum scheduling problems
• Speed-robust scheduling. Sand, bricks, and rocks

zbMATH Keywords

schedulingperformance guaranteessmoothed analysis

Mathematics Subject Classification ID

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

Cited In (3)

• Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
• Speed-robust scheduling. Sand, bricks, and rocks
• Bounds for the Convergence Time of Local Search in Scheduling Problems

This page was built for publication: Performance guarantees for scheduling algorithms under perturbed machine speeds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872085)