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 6 items.

• Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs (Q1404274) (← links)
• A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← links)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)