Pages that link to "Item:Q1761791"

The following pages link to New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791):

Displaying 2 items.

• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• The representation of partially-concurrent open shop problems (Q2398435) (← links)