Pages that link to "Item:Q880590"

The following pages link to The complexity of mean flow time scheduling problems with release times (Q880590):

Displaying 24 items.

• Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
• Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
• Minimizing mean flow time with release time constraint (Q914352) (← links)
• A decomposition scheme for single stage scheduling problems (Q983632) (← links)
• Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
• Ideal schedules in parallel machine settings (Q2029359) (← links)
• A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← 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)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
• Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
• Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity (Q2434311) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time (Q3202129) (← links)
• A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
• (Q3569627) (← links)
• Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
• Minimizing Mean Flow Time With Release Time and Deadline Constraints (Q4033756) (← links)
• (Q4356878) (← links)
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph (Q5024918) (← links)
• A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)