Pages that link to "Item:Q880590"
From MaRDI portal
The following pages link to The complexity of mean flow time scheduling problems with release times (Q880590):
Displaying 14 items.
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← 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)
- Ideal schedules in parallel machine settings (Q2029359) (← 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 jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
