Pages that link to "Item:Q914352"

The following pages link to Minimizing mean flow time with release time constraint (Q914352):

Displaying 17 items.

• The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745) (← links)
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089) (← links)
• Minimizing average completion time in the presence of release dates (Q1290642) (← links)
• Maximizing job benefits on-line (Q1348735) (← links)
• Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
• A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
• Ideal schedules in parallel machine settings (Q2029359) (← links)
• Split scheduling with uniform setup times (Q2341391) (← links)
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
• A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122) (← links)
• Approximating total flow time on parallel machines (Q2641865) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)