Optimal randomized scheduling by replacement

DOI10.1023/A:1009703014438zbMATH Open0901.90099OpenAlexW2058130952MaRDI QIDQ1383803

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

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

Related Items (1)

Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem

Recommendations

• Optimal scheduling combinatorics 👍 👎
• Optimal match-up strategies in stochastic scheduling 👍 👎
• On the optimality of exact and approximation algorithms for scheduling problems 👍 👎
• Optimal stochastic scheduling 👍 👎
• Rearrangement, Majorization and Stochastic Scheduling 👍 👎
• Scheduling with Opting Out: Improving upon Random Priority 👍 👎
• OPTIMAL SCHEDULING OF RANDOM WORKS WITH RELIABILITY APPLICATION 👍 👎
• Optimal scheduling replacement policies for a system with multiple random works 👍 👎
• Randomized algorithms for that ancient scheduling problem 👍 👎

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)