Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

Authors:
E. G. Coffman, Jr.;M. R. Garey
Affiliations:
AT&T Bell Laboratories, Murray Hill, New Jersey;AT&T Bell Laboratories, Murray Hill, New Jersey
Venue:
Journal of the ACM (JACM)
Year:
1993

Some results on Liu's conjecture

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

The power of migration in multi-processor scheduling of real-time systems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Algorithms with limited number of preemptions for scheduling on parallel machines

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
Algorithms with limited number of preemptions for scheduling on parallel machines

Journal of Combinatorial Optimization

Hi-index	0.00