Pages that link to "Item:Q5245846"
From MaRDI portal
The following pages link to Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846):
Displaying 9 items.
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production (Q2691495) (← links)
- An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling (Q2780944) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- The optimality of the online greedy algorithm in carpool and chairman assignment problems (Q3189021) (← links)