Pages that link to "Item:Q902745"
From MaRDI portal
The following pages link to Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745):
Displaying 12 items.
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
- An exact approach to early/tardy scheduling with release dates (Q1781563) (← 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)
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints (Q2356125) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Minimizing total completion time subject to job release dates and preemption penalties (Q2464427) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Minimizing Mean Flow Time With Release Time and Deadline Constraints (Q4033756) (← links)
- Scheduling to minimize release-time resource consumption and tardiness penalties (Q4865764) (← links)
