Pages that link to "Item:Q902062"

The following pages link to On the complexity of constructing multiprocessor little-preemptive schedules (Q902062):

Displayed 1 item.

• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) ‎ (← links)