Pages that link to "Item:Q398912"
From MaRDI portal
The following pages link to Online scheduling with preemption or non-completion penalties (Q398912):
Displayed 5 items.
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← 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)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)