Preemptive multiprocessor scheduling with rejection
From MaRDI portal
Publication:5958131
DOI10.1016/S0304-3975(00)00288-7zbMath0992.68072MaRDI QIDQ5958131
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
Permutation flow shop scheduling with order acceptance and weighted tardiness, Online scheduling with rejection and withdrawal, Parallel-machine scheduling with deteriorating jobs and rejection, Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines, On-line scheduling with rejection on identical parallel machines, The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan, Preemptive scheduling on a small number of hierarchical machines, Optimal on-line algorithms to minimize makespan on two machines with resource augmentation, Scheduling linear deteriorating jobs with rejection on a single machine, Single-machine scheduling under the job rejection constraint, On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups, Bounded single-machine parallel-batch scheduling with release dates and rejection, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, On-line scheduling of unit time jobs with rejection on uniform machines, Single machine scheduling with release dates and rejection, Optimal preemptive semi-online scheduling to minimize makespan on two related machines, On-line scheduling of unit time jobs with rejection: Minimizing the total completion time, Minimizing the makespan on a single parallel batching machine, Scheduling with machine cost and rejection, Separating online scheduling algorithms with the relative worst order ratio, Scheduling with rejection and non-identical job arrivals, Online scheduling with machine cost and rejection, Bin packing problems with rejection penalties and their dual problems, On Variants of File Caching, An Optimal Incremental Algorithm for Minimizing Lateness with Rejection, Scheduling deteriorating jobs with rejection on dominant machines
Cites Work
- Unnamed Item
- A lower bound for randomized on-line multiprocessor scheduling
- New algorithms for an ancient scheduling problem.
- Competitive snoopy caching
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line scheduling algorithms
- New lower and upper bounds for on-line scheduling
- An optimal algorithm for preemptive on-line scheduling
- Scheduling with Deadlines and Loss Functions
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Techniques for scheduling with rejection
- A Better Algorithm for an Ancient Scheduling Problem
- Multiprocessor Scheduling with Rejection
- Randomized algorithms for that ancient scheduling problem
