A Level Algorithm for Preemptive Scheduling
From MaRDI portal
Cited in
(42)- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
- Uniform parallel machine scheduling problems with fixed machine cost
- Online scheduling on semi-related machines
- Approximation scheduling algorithms: a survey
- Semi-online preemptive scheduling: one algorithm for all variants
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Preemptive online scheduling: Optimal algorithms for all speeds
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Efficient scheduling of tasks without full use of processor resources
- A state-of-the-art review of parallel-machine scheduling research
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Scheduling uniform machines on-line requires nondecreasing speed ratios
- Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
- Optimal allocation for chunked-reward advertising
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- A lower bound for on-line scheduling on uniformly related machines
- Ideal schedules in parallel machine settings
- Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
- Parallel machine covering with limited number of preemptions
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- New applications of the Muntz and Coffman algorithm
- Robust algorithms for preemptive scheduling
- NP-Complete operations research problems and approximation algorithms
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Optimal and online preemptive scheduling on uniformly related machines
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
- Preemptive Scheduling on Selfish Machines
- Improved revenue bounds for posted-price and second-price mechanisms
- On-line scheduling with precedence constraints
- The benefit of preemption with respect to the \(\ell_p\) norm
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Algorithms with limited number of preemptions for scheduling on parallel machines
- Optimal preemptive scheduling for general target functions
- Preemptive machine covering on parallel machines
This page was built for publication: A Level Algorithm for Preemptive Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126043)
