A Level Algorithm for Preemptive Scheduling
From MaRDI portal
Publication:4126043
DOI10.1145/321992.321995zbMath0354.90044OpenAlexW2036711992MaRDI QIDQ4126043
No author found.
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321992.321995
Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35)
Related Items (40)
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms ⋮ Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines ⋮ Optimal preemptive scheduling on uniform machines with discounted flowtime objectives ⋮ Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times ⋮ Optimal Allocation for Chunked-Reward Advertising ⋮ The benefit of preemption with respect to the \(\ell_p\) norm ⋮ Preemptive online scheduling with rejection of unit jobs on two uniformly related machines ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Efficient scheduling of tasks without full use of processor resources ⋮ Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Parallel machine covering with limited number of preemptions ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Preemptive scheduling of periodic jobs in uniform multiprocessor systems ⋮ Robust algorithms for preemptive scheduling ⋮ A lower bound for on-line scheduling on uniformly related machines ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ Online scheduling on semi-related machines ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Algorithms with limited number of preemptions for scheduling on parallel machines ⋮ New applications of the Muntz and Coffman algorithm ⋮ Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios ⋮ Ideal schedules in parallel machine settings ⋮ Preemptive Scheduling on Selfish Machines ⋮ A Truthful Mechanism for Offline Ad Slot Scheduling ⋮ OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES ⋮ Preemptive online scheduling: Optimal algorithms for all speeds ⋮ NP-Complete operations research problems and approximation algorithms ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ Approximation scheduling algorithms: a survey ⋮ Optimal and online preemptive scheduling on uniformly related machines ⋮ Scheduling uniform machines on-line requires nondecreasing speed ratios ⋮ Optimal preemptive scheduling for general target functions ⋮ Preemptive machine covering on parallel machines ⋮ On-line scheduling with precedence constraints ⋮ Optimal preemptive semi-online scheduling to minimize makespan on two related machines ⋮ An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
This page was built for publication: A Level Algorithm for Preemptive Scheduling
