Pages that link to "Item:Q398912"
From MaRDI portal
The following pages link to Online scheduling with preemption or non-completion penalties (Q398912):
Displaying 13 items.
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- Lower bounds on online deadline scheduling with preemption penalties (Q975450) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← links)
- A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach (Q2289910) (← links)
- On-line production order scheduling with preemption penalties (Q2385487) (← links)
- Minimizing total completion time subject to job release dates and preemption penalties (Q2464427) (← links)
- Aggressive online deadline scheduling (Q2845522) (← links)
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties (Q3578339) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Algorithms - ESA 2003 (Q5897233) (← links)