Scheduling independent tasks on uniform processors

Optimal Non-preemptive Semi-online Scheduling on Two Related Machines

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Task Distributions on Multiprocessor Systems

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics

Optimal non-preemptive semi-online scheduling on two related machines

Journal of Algorithms

Makespan minimization for multiple uniform machines

Computers and Industrial Engineering

Coordination mechanisms for selfish scheduling

Theoretical Computer Science

Tighter approximation bounds for LPT scheduling in two special cases

Journal of Discrete Algorithms

Optimal and online preemptive scheduling on uniformly related machines

Journal of Scheduling

Non-clairvoyant Scheduling Games

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory

Optimal non-preemptive semi-online scheduling on two related machines

Journal of Algorithms

On performance analysis of hybrid algorithm (improved PSO with simulated annealing) with GA, PSO for multiprocessor job scheduling

WSEAS Transactions on Computers

Scheduling job classes on uniform machines

Computers and Operations Research

Tighter approximation bounds for LPT scheduling in two special cases

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Optimal preemptive semi-online scheduling to minimize makespan on two related machines

Operations Research Letters

A note on LPT scheduling

Operations Research Letters

Coordination mechanisms for selfish parallel jobs scheduling

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Approximate strong equilibria in job scheduling games with two uniformly related machines

Discrete Applied Mathematics