Preemptive Scheduling of Uniform Processor Systems
From MaRDI portal
Publication:4139680
DOI10.1145/322047.322055zbMath0364.68046OpenAlexW2073821436MaRDI QIDQ4139680
Teofilo F. Gonzalez, Sartaj K. Sahni
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322047.322055
Related Items
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms, Parametric analysis of the quality of single preemption schedules on three uniform parallel machines, Planning computations in a multiprocessor system with unfixed parameters, Optimal preemptive semi-online scheduling on two uniform processors, On the Complexity of Scheduling to Optimize Average Response Time, Some algorithms for resource allocation in multiprocessor systems, A survey of scheduling with controllable processing times, Separating online scheduling algorithms with the relative worst order ratio, 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, A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, The Open Shop Scheduling Problem, Scheduling on power-heterogeneous processors, Schedules with a single preemption on uniform parallel machines, The benefit of preemption with respect to the \(\ell_p\) norm, Scheduling multiprocessor tasks on parallel processors with limited availability., Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, The battery switching station scheduling problem, 1-optimality of static BSP computations: Scheduling independent chains as a case study., On the complexity of scheduling unrelated parallel machines with limited preemptions, Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions, Heuristics and augmented neural networks for task scheduling with non-identical machines, Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors, Parallel machine covering with limited number of preemptions, Preemptive scheduling of periodic jobs in uniform multiprocessor systems, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Robust algorithms for preemptive scheduling, Preemptive scheduling on uniform parallel machines with controllable job processing times, A lower bound for on-line scheduling on uniformly related machines, The bike sharing problem, On the geometry, preemptions and complexity of multiprocessor and shop scheduling, Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information, Optimal correction of execution intervals for multiprocessor scheduling with additional resource, Computation planning in multiprocessor real time automated control systems with an additional resource, Combinatorial optimization algorithms combining greedy strategies with a limited search procedure, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Semi-online preemptive scheduling: one algorithm for all variants, Job Tardiness in Unequal Parallel Processor Systems, Optimal semi-online preemptive algorithms for machine covering on two uniform machines, Algorithms with limited number of preemptions for scheduling on parallel machines, Scheduling on semi-identical processors, Some algorithms for analysis and synthesis of real-time multiprocessor computing systems, New applications of the Muntz and Coffman algorithm, APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS, Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios, Minimizing mean weighted execution time loss on identical and uniform processors, An algorithm for constructing single processor static-dynamic schedules, Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph, A unified view of parallel machine scheduling with interdependent processing rates, Scheduling in multiprocessor systems with additional restrictions, Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals, 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, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, Preemptive online scheduling: Optimal algorithms for all speeds, Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function, Scheduling independent two processor tasks on a uniform duo-processor system, Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes, Integrality Property in Preemptive Parallel Machine Scheduling, Optimal and online preemptive scheduling on uniformly related machines, Scheduling uniform machines on-line requires nondecreasing speed ratios, Scheduling subject to resource constraints: Classification and complexity, Preemptive and non-preemptive scheduling on two unrelated parallel machines, Single parameter analysis of power of preemption on two and three uniform machines, Preemptive on-line scheduling for two uniform processors, Optimal preemptive scheduling for general target functions, Preemptive machine covering on parallel machines, Scheduling chains on uniform processors with communication delays, On-line scheduling with precedence constraints, An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
