Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling

Edward G. Coffman Jr., M. R. Garey. Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, 6-8 May 1991, New Orleans, Louisiana, USA. pages 241-248, ACM, 1991.

Abstract

Abstract is missing.