Pages that link to "Item:Q2432888"

The following pages link to A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888):

Displaying 10 items.

• Preemptive scheduling of interval orders is polynomial (Q913500) (← links)
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
• A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465) (← links)
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
• A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291) (← links)
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph (Q2508774) (← links)
• A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
• Logic versus Approximation (Q5712371) (← links)