Probabilistic analysis for scheduling with conflicts
From MaRDI portal
Publication:924143
DOI10.1016/j.tcs.2008.01.027zbMath1145.68005MaRDI QIDQ924143
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
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
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