Pages that link to "Item:Q910208"

The following pages link to Preemptive scheduling to minimize mean weighted flow time (Q910208):

Displaying 8 items.

• Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
• The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
• Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
• On the optimality of the earliest due date rule in stochastic scheduling and in queueing (Q2076926) (← links)
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)