Pages that link to "Item:Q2356125"
From MaRDI portal
The following pages link to A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints (Q2356125):
Displaying 10 items.
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745) (← links)
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894) (← links)
- Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines (Q2231743) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
- Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines (Q6593671) (← links)
