Pages that link to "Item:Q5713435"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713435):
Displaying 18 items.
- Online optimization of busy time on parallel machines (Q477193) (← links)
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines (Q763104) (← links)
- Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling (Q1018336) (← links)
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem (Q1046710) (← links)
- Online scheduling of parallel programs on heterogeneous systems with applications to Cilk (Q1849575) (← links)
- Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← links)
- On index policies for stochastic minsum scheduling (Q2294301) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- LP-Based Online Scheduling: From Single to Parallel Machines (Q3596362) (← links)
- On-Line Scheduling of Imprecise Computations to Minimize Error (Q4714561) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Models and Algorithms for Stochastic Online Scheduling (Q5387994) (← links)
- LPT online strategy for parallel-machine scheduling with kind release times (Q5963697) (← links)
- Machine learning-based online scheduling in distributed computing (Q6135487) (← links)
