Pages that link to "Item:Q2892135"

The following pages link to Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135):

Displaying 2 items.

• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)