Pages that link to "Item:Q2633586"

The following pages link to An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586):

Displaying 5 items.

• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
• On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) (← links)