Optimal randomized scheduling by replacement

DOI10.1023/A:1009703014438MaRDI QIDQ1383803zbMATH OpenOpenAlexFDO

Authors Isaac Saias

Publication date 13 April 1998

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009703014438

zbMATH Keywords

absolute performance measureadaptive online adversariesreplacement scheduling

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal scheduling replacement policies for a system with multiple random works
• Optimal stochastic scheduling
• Rearrangement, Majorization and Stochastic Scheduling
• Optimal scheduling of random works with reliability application
• Randomized algorithms for that ancient scheduling problem
• Optimal match-up strategies in stochastic scheduling
• Optimal scheduling combinatorics
• On the optimality of exact and approximation algorithms for scheduling problems
• Scheduling with Opting Out: Improving upon Random Priority

Cited in

(2)

• Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem
• Protocol scheduling

This page was built for publication: Optimal randomized scheduling by replacement

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