Pages that link to "Item:Q2434279"
From MaRDI portal
The following pages link to Minimizing total tardiness on parallel machines with preemptions (Q2434279):
Displaying 11 items.
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
- Erratum to: ``Minimizing total tardiness on parallel machines with preemptions'' (Q398871) (← links)
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440) (← links)
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs (Q3329199) (← links)
- Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol (Q3390115) (← links)
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time (Q4661237) (← links)
- New Precedence Theorems for One-Machine Weighted Tardiness (Q5388048) (← links)
- Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)