Lower bounds for on-line single-machine scheduling.
From MaRDI portal
Publication:1874403
DOI10.1016/S0304-3975(02)00488-7zbMATH Open1040.68007OpenAlexW2058876827MaRDI QIDQ1874403FDOQ1874403
Authors: Leah Epstein, Rob van Stee 
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00488-7
Recommendations
- scientific article; zbMATH DE number 1834660
- A lower bound for on-line scheduling on uniformly related machines
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- A note on on-line scheduling with precedence constraints on identical machines
- scientific article; zbMATH DE number 1182764
Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Single machine scheduling with release dates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation techniques for average completion time scheduling
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Title not available (Why is that?)
- Algorithms for minimizing weighted flow time
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Title not available (Why is that?)
Cited In (12)
- A note on on-line scheduling with precedence constraints on identical machines
- Single machine batch scheduling with release times
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Title not available (Why is that?)
- A better lower bound for on-line scheduling
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- On competitive analysis for polling systems
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- Lower bounds on online deadline scheduling with preemption penalties
This page was built for publication: Lower bounds for on-line single-machine scheduling.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874403)
