Pages that link to "Item:Q1332457"
From MaRDI portal
The following pages link to Approximation algorithms for some discrete-continuous scheduling problems (Q1332457):
Displaying 8 items.
- On the complexity of scheduling tasks with discrete starting times (Q1195868) (← links)
- Discrete-continuous scheduling problems -- mean completion time results (Q1278310) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- An experimental study of LP-based approximation algorithms for scheduling problems (Q2890462) (← links)
- (Q3142061) (← links)
- (Q4866348) (← links)
- (Q5128459) (← links)
- Theory and Applications of Models of Computation (Q5898864) (← links)