Tighter bounds for LPT scheduling on uniform processors

Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors

Proceedings of the 1992 ACM/IEEE conference on Supercomputing

Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)

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

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

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

Journal of Algorithms

Makespan minimization for multiple uniform machines

Computers and Industrial Engineering

New efficiency results for makespan cost sharing

Information Processing Letters

Coordination mechanisms for selfish scheduling

Theoretical Computer Science

Fair cost-sharing methods for scheduling jobs on parallel machines

Journal of Discrete Algorithms

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

Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Fair cost-sharing methods for scheduling jobs on parallel machines

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

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

Online minimum makespan scheduling with a buffer

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

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