Pages that link to "Item:Q2400440"

The following pages link to The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440):

Displaying 3 items.

• Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
• Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
• Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)