Probabilistic analysis for scheduling with conflicts

DOI10.1016/j.tcs.2008.01.027zbMath1145.68005OpenAlexW2021137377MaRDI QIDQ924143

Sandy Irani, Vitus J. Leung

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.027

zbMATH Keywords

schedulingonline algorithmsprobabilistic analysisqueueing theoryconflict graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonclairvoyant scheduling
• Scheduling with incompatible jobs
• Mutual exclusion scheduling
• Guaranteeing Fair Service to Persistent Dependent Tasks
• Scheduling of incompatible jobs on unrelated machines
• Beyond Competitive Analysis
• Extreme Values in the GI/G/1 Queue
• Scheduling with forbidden sets

This page was built for publication: Probabilistic analysis for scheduling with conflicts