Pages that link to "Item:Q3541133"
From MaRDI portal
The following pages link to Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133):
Displaying 3 items.
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)