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):
Displayed 5 items.
- 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)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)