Pages that link to "Item:Q4888150"

The following pages link to Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times (Q4888150):

Displaying 1 item.

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