A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

Alan A. Bertossi, Maurizio A. Bonuccelli. A polynomial feasibility test for preemptive periodic scheduling of unrelated processors. Discrete Applied Mathematics, 12(3):195-201, 1985. [doi]

Abstract

Abstract is missing.