Algorithms for Scheduling Tasks on Unrelated Processors
From MaRDI portal
Publication:3925878
DOI10.1145/322276.322284zbMath0472.68020OpenAlexW2005845593WikidataQ128252770 ScholiaQ128252770MaRDI QIDQ3925878
Jeffrey M. Jaffe, Ernest Davis
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322276.322284
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items
Dynamic scheduling on parallel machines, Scheduling algorithms for procrastinators, On-line service scheduling, Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach, Unrelated parallel machine scheduling using local search, Optimal Coordination Mechanisms for Unrelated Machine Scheduling, A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search, Exact and approximation algorithms for makespan minimization on unrelated parallel machines, Scheduling unit-time jobs on processors with different capabilities, Scheduling unrelated parallel machines with sequence-dependent setups, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems, Efficient scheduling of tasks without full use of processor resources, Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC, Unrelated parallel machine scheduling -- perspectives and progress, An optimal rounding gives a better approximation for scheduling unrelated machines, Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach, On the message complexity of distributed problems, Heuristics for scheduling unrelated parallel machines, Iterated greedy local search methods for unrelated parallel machine scheduling, Decentralized utilitarian mechanisms for scheduling games, 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines, Coordination mechanisms for selfish scheduling, Approximation algorithms for scheduling unrelated parallel machines, Approximation scheduling algorithms: a survey, The Pareto frontier of inefficiency in mechanism design, Heuristics for unrelated machine scheduling with precedence constraints, A cutting plane algorithm for the unrelated parallel machine scheduling problem, Restarts can help in the on-line minimization of the maximum delivery time on a single machine, Worst-case analysis of a scheduling algorithm, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, On-line scheduling with precedence constraints, THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING, A note on on-line scheduling with precedence constraints on identical machines
