The following pages link to (Q4411083):
Displaying 11 items.
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule (Q475118) (← links)
- Dynamic scheduling to minimize lost sales subject to set-up costs (Q1281688) (← links)
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule (Q1909403) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- Submodular returns and greedy heuristics for queueing scheduling problems (Q2781095) (← links)
- Dynamising Interval Scheduling: The Monotonic Case (Q2870026) (← links)
- Dynamic schedule optimization based on a correlation scheduling model (Q2886113) (← links)
- Nested Optimal Policies for Set Functions with Applications to Scheduling (Q3682237) (← links)
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control (Q4016954) (← links)
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
- Asynchronous Optimization over Weakly Coupled Renewal Systems (Q5113883) (← links)
